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… 
2010
2010
This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O… 
2006
2006
Performance evaluation shows that Hierarchical Mobile IPv6 (HMIPv6) cannot outperform standard Mobile IPv6 (MIPv6) in all… 
2004
2004
In this paper, we propose a mobility-based load control scheme, which consists of two sub-algorithms: (1) a threshold-based… 
2000
2000
In data warehouse and data mart systems, queries often take a long time to execute due to their complex nature. Query response… 
1999
1999
With an ever increasing amount of data to store, hierarchical storage management (HSM) systems must still use tape for tertiary… 
1989
1989
This paper describes an ambitious early design for a VM system for Psyche. Our plans for VM were scaled back substantially after… 
1978
1978
  • R. Jain
  • 1978
  • Corpus ID: 31766779
Abstract : In this thesis we propose the following general control-theoretic approach to the formulation of resource management… 
1975
1975
The designer of a virtual memory system can obtain accurate estimates of the average memory requirements of programs running in… 
1975
1975
A model for program behavior, the renewal model, is introduced; its properties are discussed, and its ability to model the…