Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,771 papers from all fields of science
Search
Sign In
Create Free Account
Page replacement algorithm
Known as:
Second chance replacement strategy
, Page replacement
, Replacement algorithm
Expand
In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
37 relations
ARM architecture
Adaptive replacement cache
Amortized analysis
Arithmetic shift
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Sub-Circuit Selection and Replacement Algorithms Modeled as Term Rewriting Systems
Eric D. Simonaire
2012
Corpus ID: 60934188
Abstract : Intent protection is a model of software obfuscation which, among other criteria, prevents an adversary from…
Expand
2011
2011
A Comparison of Page Replacement Algorithms
Amit Chavan
,
Kartik Nayak
,
Keval Vora
,
M. Purohit
,
P. Chawan
2011
Corpus ID: 61363581
A virtual memory system needs efficient page replacement algorithms to decide which pages to evict from memory in case of a page…
Expand
2004
2004
A mobility-based load control scheme at mobility anchor point in hierarchical mobile IPv6 networks
S. Pack
,
Taekyoung Kwon
,
Yanghee Choi
IEEE Global Telecommunications Conference…
2004
Corpus ID: 10112436
In this paper, we propose a mobility-based load control scheme, which consists of two sub-algorithms: (1) a threshold-based…
Expand
2004
2004
Study of the Impact of Replacement Granularity and Associated Strategies on Video Caching
E. Balafoutis
,
A. Panagakis
,
Nikolaos Laoutaris
,
I. Stavrakakis
Cluster Computing
2004
Corpus ID: 660812
Abstract Partial caching of large media objects such as video files has been proposed recently as the caching of entire objects…
Expand
2001
2001
Improving Replacement Decisions in Set-Associative Caches
Zhenlin Wang
,
K. McKinley
,
A. Rosenberg
2001
Corpus ID: 18887565
Cache replacement policies play a key role in determining hit rates in set-associative caches. Cache replacement algorithms use…
Expand
2000
2000
Don't Trash your Intermediate Results, Cache 'em
Prasan Roy
,
K. Ramamritham
,
S. Seshadri
,
P. Shenoy
,
S. Sudarshan
arXiv.org
2000
Corpus ID: 16958557
In data warehouse and data mart systems, queries often take a long time to execute due to their complex nature. Query response…
Expand
1999
1999
Improved adaptive replacement algorithm for disk caches in HSM systems
Ulrich Hahn
,
Werner Dilling
,
D. Kaletta
16th IEEE Symposium on Mass Storage Systems in…
1999
Corpus ID: 7898705
With an ever increasing amount of data to store, hierarchical storage management (HSM) systems must still use tape for tertiary…
Expand
1990
1990
Cluster paging for traveling subscribers
D. Muñoz-Rodríguez
40th IEEE Conference on Vehicular Technology
1990
Corpus ID: 61572244
A general paging problem formulation for mobile subscribers in cellular systems bearing in mind the number of paging signals and…
Expand
1989
1989
Memory Management for Large-Scale NUMA Multiprocessors
T. LeBlanc
,
B. Marsh
,
M. Scott
1989
Corpus ID: 61100207
This paper describes an ambitious early design for a VM system for Psyche. Our plans for VM were scaled back substantially after…
Expand
1975
1975
The Renewal Model for Program Behavior
H. Opderbeck
,
W. Chu
SIAM journal on computing (Print)
1975
Corpus ID: 29940472
A model for program behavior, the renewal model, is introduced; its properties are discussed, and its ability to model the…
Expand