Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,890,167 papers from all fields of science
Search
Sign In
Create Free Account
Thrashing (computer science)
Known as:
Disk thrashing
, Page thrash
, Thrash (computer science)
Expand
In computer science, thrashing occurs when a computer's virtual memory subsystem is in a constant state of paging, rapidly exchanging data in memory…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
CPU cache
Commitment ordering
Comparison of Java and C++
Computer memory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Decoupled dynamic cache segmentation
S. Khan
,
Zhe Wang
,
Daniel A. Jiménez
IEEE International Symposium on High-Performance…
2012
Corpus ID: 11850947
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of…
Expand
2011
2011
HTTP Live Streaming Bandwidth Management Using Intelligent Segment Selection
K. Ma
,
R. Bartos
Global Communications Conference
2011
Corpus ID: 20886734
HTTP-based segmented delivery has become a popular choice for video distribution. The ability for clients to explicitly perform…
Expand
2006
2006
Ambient intelligence in medicine
J. Machado
,
A. Abelha
,
J. Neves
,
M. Santos
IEEE Biomedical Circuits and Systems Conference
2006
Corpus ID: 7791755
The electronic medical record (EMR) is a core application which covers horizontally the health care unit and makes possible a…
Expand
2005
2005
Pheromone learning for self-organizing agents
H. V. Parunak
,
Sven A. Brueckner
,
R. Matthews
,
J. Sauter
IEEE Transactions on Systems, Man, and…
2005
Corpus ID: 2633592
A central issue in distributed systems engineering is enabling agents with only a local view of their environment to take actions…
Expand
2004
2004
An Improved Least-Slack-First Scheduling Algorithm
Jin Hong
,
Wang Hong-an
,
Wang Qiang
,
Dai Guo-zhong
2004
Corpus ID: 11016145
The LSF (least slack first) algorithm assigns a priority to a task according to its executing urgency. The smaller the remaining…
Expand
2002
2002
TPF: a dynamic system thrashing protection facility
Song Jiang
,
Xiaodong Zhang
Software, Practice & Experience
2002
Corpus ID: 16996326
Operating system designers attempt to keep high CPU utilization by maintaining an optimal multiprogramming level (MPL). Although…
Expand
Highly Cited
1996
Highly Cited
1996
Fast string searching in secondary storage: theoretical developments and experimental results
P. Ferragina
,
R. Grossi
ACM-SIAM Symposium on Discrete Algorithms
1996
Corpus ID: 5171033
In a previous work, we proposed a text indexing data structure for secondary storage, which we called SB-tree, that combines the…
Expand
1995
1995
On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems
M. Squillante
Job Scheduling Strategies for Parallel Processing
1995
Corpus ID: 89973
In this paper we analyze the benefits and limitations of dynamic partitioning across a wide range of parallel system environments…
Expand
1993
1993
From the Velvets to the Voidoids: A Pre-Punk History for a Post-Punk World
Clinton Heylin
1993
Corpus ID: 190992120
Preface: credit where it's due - the appropriation of punk history. Part 1 Precursors: happiness is a warm drone (1961-5) - the…
Expand
Highly Cited
1985
Highly Cited
1985
On the Thrashing Cusp in Slotted Aloha Systems
Y. Onozato
,
S. Noguchi
IEEE Transactions on Communications
1985
Corpus ID: 42311570
We develop a new tool for performance evaluation of a multiaccess communication system. We give an explicit detailed analytic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE