research-article

First-in not referenced first-out page replacement algorithm

Authors:

A. Patil,

M. Prakash,

A. NimkarAuthors Info & Claims

ICWET '11: Proceedings of the International Conference & Workshop on Emerging Trends in Technology

Pages 443 - 446

https://doi.org/10.1145/1980022.1980116

Published: 25 February 2011 Publication History

Get Access

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.

References

[1]

W. W. Chu, H. Opderbeck. 1976. Program Behavior and the Page-Fault-Frequency Replacement Algorithm, Computer, vol. 9(Nov. 1976), no. 11, pp. 29--38.

Digital Library

Google Scholar

[2]

E. Sadeh. 1975. 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, Volume 9 Issue(5, November 1975)

Digital Library

Google Scholar

[3]

D. H. Grit and R. Y. Kain. 1975. An analysis of a use bit page replacement algorithm, Proc. ACM Conf., pp. 187

Digital Library

Google Scholar

[4]

W. H. Burkhardt and C.-Yu Chow. 1972. A survey of replacement algorithms in virtual memory operating systems, Dep. of Comput. Sci., Univ. of Pittsburgh

Google Scholar

[5]

J. R. Spirn and P. J. Denning. 1972. Experiments with Program Locality, AFIPS Conf. Proc., FJCC, vol. 41, pp. 611

Digital Library

Google Scholar

[6]

G. S. Shedler and C. Tung. 1972. Locality in page reference strings, SIAM J. Comput., vol. 1, pp. 218

Digital Library

Google Scholar

[7]

William Tetzlaff. A comparison of page replacement Algorithms, Robert Flynn Polytechnic University Hawthorne, New York

Google Scholar

Index Terms

First-in not referenced first-out page replacement algorithm
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management

Recommendations

The least-dirty-first cache replacement policy for phase-change memory
SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing

Phase-change memory (PCM) is a promising non-volatile memory technology that is anticipated to be used as main memory of computer systems in the not too far future. However, PCM has relatively long write latency and limited write endurance compared to ...
On first-come, first-served queues with two classes of impatient customers

We study systems with two classes of impatient customers who differ across the classes in their distribution of service times and patience times. The customers are served on a first-come, first-served basis (FCFS) regardless of their class. Such systems ...
Page replacement algorithms for NAND flash memory storages
ICCSA'07: Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I

This paper presents new page replacement algorithms for NAND flash memory, called CFLRU/C, CFLRU/E, and DL-CFLRU/E. The algorithms aim at reducing the number of erase operations and improving the wear-leveling degree of flash memory. In the CFLRU/C and ...

Comments

Information & Contributors

Information

Published In

ICWET '11: Proceedings of the International Conference & Workshop on Emerging Trends in Technology

February 2011

1385 pages

ISBN:9781450304498

DOI:10.1145/1980022

Program Chair:
B. K. Mishra

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGAI: ACM Special Interest Group on Artificial Intelligence

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 February 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICWET '11

Sponsor:

Thakur College Of Engg. & Tech

ICWET '11: International Conference & Workshop on Emerging Trends in Technology

February 25 - 26, 2011

Maharashtra, Mumbai, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
125
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

The least-dirty-first cache replacement policy for phase-change memory

On first-come, first-served queues with two classes of impatient customers

Page replacement algorithms for NAND flash memory storages

Comments

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Index Terms

Recommendations

The least-dirty-first cache replacement policy for phase-change memory

On first-come, first-served queues with two classes of impatient customers

Page replacement algorithms for NAND flash memory storages

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations