Skip to search formSkip to main contentSkip to account menu

Page replacement algorithm

Known as: Second chance replacement strategy, Page replacement, Replacement algorithm 
In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
this paper, a new page replacement algorithm has been represented that has a better performance in average than quondam methods… 
2014
2014
Sparse signal restoration is usually formulated as the minimization of a quadratic cost function |y-Ax ||2<sup>2</sup> where \mbi… 
2010
2010
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In… 
2009
2009
Solid State Disks (SSDs) using NAND flash memory are increasingly being adopted in the high-end servers of datacenters to improve… 
2004
2004
In this paper, we propose a mobility-based load control scheme, which consists of two sub-algorithms: (1) a threshold-based… 
Highly Cited
2003
Highly Cited
2003
2001
2001
In this paper, an effective probability-based tile pre-fetching algorithm and a collaborative cache replacement algorithm for Web… 
2000
2000
We study design alternatives for, and describe implementations and performance of, a scalable and highly available Web server… 
Highly Cited
1976
Highly Cited
1976
This paper gives a summary of the research which led to the design of the cache memory in the DEC PDP-11/70. The concept of cache… 
1975
1975
The designer of a virtual memory system can obtain accurate estimates of the average memory requirements of programs running in…