First-in not referenced first-out page replacement algorithm

Authors:
A. Patil;M. Prakash;A. Nimkar
Affiliations:
Sardar Patel Institute of Technology, Mumbai, India;Sardar Patel Institute of Technology, Mumbai, India;Sardar Patel Institute of Technology, Mumbai, India
Venue:
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Year:
2011

Citing 4
Cited 0

An analysis of the performance of the page fault frequency (PFF) replacement algorithm.

SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
An analysis of a use bit page replacement algorithm

ACM '75 Proceedings of the 1975 annual conference
Program Behavior and the Page-Fault-Frequency Replacement Algorithm

Computer
Experiments with program locality

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are many page replacement algorithms in use today. The most common ones are FIFO, LRU, and clock. Most of these do not conform to the principle of locality. According to this principle, the memory references tend to be clustered over a short period of time. Thus, by this principle, if a page has been referenced, then it is very likely that it will be referenced in the future again. First-in not referenced first-out algorithm tries to give a second chance to those pages which have been referenced once, while in memory.