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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Due to the limited main memory resource of consumer electronics equipped with NAND flash memory as storage device, an efficient… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
In this paper, a new page replacement algorithm has been represented that has a better performance in average than quondam… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In most operating systems which are customized for disk-based storage system, the replacement algorithm concerns only the number… (More)
  • table 1
  • figure 1
  • figure 2
  • table 3
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper analyzes a recently published algorithm for page replacement in hierarchical paged memory systems [O'Neil et al. 1993… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
As disk performance continues to lag behind that of memory systems and processors, virtual memory management becomes increasingly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In a path-breaking paper last year Pat and Betty O’Neil and Gerhard Weikum pro posed a self-tuning improvement to the Least… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper introduces a new approach to database disk buffering, called the LRU-K method. The basic idea of LRU-K is to keep… (More)
  • table 4.1
  • table 4.2
  • table 4.3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults… (More)
Is this relevant?
1974
1974
Although paged VM (Virtual Memory) systems are being implemented more and more, their full capabilities have not yet been… (More)
  • table I
  • figure 1
  • table II
  • table III
Is this relevant?
Highly Cited
1971
Highly Cited
1971
ABSTP~CT. A formal model is presented for paging algorithms under /-order nonstat ionary assumptions about program behavior. When… (More)
Is this relevant?