article

Free access

On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies

Authors:

Chong Sang KimAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 27, Issue 1

Pages 134 - 143

https://doi.org/10.1145/301464.301487

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

E. J. O'Neil, P. E. O'Neil, and G. Weikum, "The LRU- K Page Replacement Algorithm For Database Disk Buffering," in Proceedings of the 1998 A CM SIGMOD Conference, pp. 297-306, 1993.]]

Digital Library

Google Scholar

[2]

J. T. Robinson and N. V. Devarakonda, "Data Cache Management Using Frequency-Based Replacement," in Proceedings of the 1990 A CM SIGMETRIGS Conference, pp. 134-142, 1990.]]

Digital Library

Google Scholar

[3]

T. Johnson and D. Shasha, "2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm," in Proceedings of the 20th International Conference on Very Large Data Bases, pp. 439-450, 1994.]]

Digital Library

Google Scholar

[4]

W. Effelsberg and T. Haerder, "Principles of Database Buffer Management," A CM Transactions on Database Systems, vol. 9, no. 4, pp. 560-595, 1984.]]

Digital Library

Google Scholar

[5]

C. Faloutsos, R. Ng, and T. Selfis, "Flexible and Adaptable Buffer Management Techniques for Database Management Systems," 1EEE Transactions on Computers, vol. 44, no. 4, pp. 546-560, 1995.]]

Digital Library

Google Scholar

[6]

P. Cao, E. W. Felten, and K. Li, "Application- Controlled File Caching Policies," in Proceedings of the Summer 1994 USENIX Conference, pp. 171-182, 1994.]]

Digital Library

Google Scholar

[7]

M. G. Baker, J. H. Hartman, M. D. Kupfer, K. W. Shirriff, and J. K. Ousterhout, "Measurements of a Distributed File System," in Proceedings of the 13th A CM Symposium on Operating Systems Principles, pp. 198- 212, 1991.]]

Digital Library

Google Scholar

[8]

SPEC, "SPEC SDM Release 1.1," Mar. 1992.]]

Google Scholar

[9]

G. S. Gao, "Performance Analysis of Cache Memories," Journal of A CM, vol. 25, no. 3, pp. 378-395, July 1978.]]

Digital Library

Google Scholar

[10]

J. R. Spirn, Program Behavior: Models and Measurements. Elsevier North-Holland, NY, 1977.]]

Digital Library

Google Scholar

Cited By

View all

Vanerio JHügerich LSchmid S(2024)Tero: Offloading CDN Traffic to Massively Distributed DevicesProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631556(186-198)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631556
Jia RChen ZWu CLi JGuo MHuang H(2024)RL-Cache: An Efficient Reinforcement Learning Based Cache Partitioning Approach for Multi-Tenant CDN Services2024 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER59578.2024.00025(202-213)Online publication date: 24-Sep-2024
https://doi.org/10.1109/CLUSTER59578.2024.00025
Sharif SYaghmaee Moghaddam MHosseini Seno S(2024)A hybrid Bi-level management framework for caching and communication in Edge-AI enabled IoTJournal of Network and Computer Applications10.1016/j.jnca.2024.104000232:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.jnca.2024.104000
Show More Cited By

Index Terms

On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
1. Information systems
  1. Data management systems
    1. Database management system engines
  2. Information storage systems
    1. Storage management
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management
        Memory management

Recommendations

On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
SIGMETRICS '99: Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delay sensitive least frequently used algorithm for replacement in web caches

Caching at proxy servers plays an important role in reducing the response time, network delays, and load on the Web servers. The performance of caching depends critically on the design of the cache replacement algorithm. Most of the cache replacement ...
Self-correcting LRU replacement policies
CF '04: Proceedings of the 1st conference on Computing frontiers

L1 caches must be fast and have a good hit rate at the same time. To be fast, they must remain small. To have a good hit rate, they must be set-associative. With wider associativity the replacement algorithm becomes critical. The wide performance gap ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 27, Issue 1

June 1999

235 pages

ISSN:0163-5999

DOI:10.1145/301464

Chairmen:
Daniel A. Menasce
George-Mason Univ., Fairfax, VA
,
Carey Williamson
Univ. of Saskatchewan, Saskatoon, Sask., Canada

Issue’s Table of Contents

SIGMETRICS '99: Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
May 1999
237 pages
ISBN:158113083X
DOI:10.1145/301453
Chairmen:
Daniel A. Menasce
George Mason Univ., Fairfax, VA
,
Carey Williamson
Univ. of Saskatchewan, Saskatoon, Sask., Canada

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Published in SIGMETRICS Volume 27, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

234
Total Citations
View Citations
2,296
Total Downloads

Downloads (Last 12 months)455
Downloads (Last 6 weeks)55

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vanerio JHügerich LSchmid S(2024)Tero: Offloading CDN Traffic to Massively Distributed DevicesProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631556(186-198)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631556
Jia RChen ZWu CLi JGuo MHuang H(2024)RL-Cache: An Efficient Reinforcement Learning Based Cache Partitioning Approach for Multi-Tenant CDN Services2024 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER59578.2024.00025(202-213)Online publication date: 24-Sep-2024
https://doi.org/10.1109/CLUSTER59578.2024.00025
Sharif SYaghmaee Moghaddam MHosseini Seno S(2024)A hybrid Bi-level management framework for caching and communication in Edge-AI enabled IoTJournal of Network and Computer Applications10.1016/j.jnca.2024.104000232:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.jnca.2024.104000
Liu ZCai KZhang JXin N(2023)An Online Caching Scheme for 360-Degree Videos at the Edge2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall)10.1109/VTC2023-Fall60731.2023.10333413(1-6)Online publication date: 10-Oct-2023
https://doi.org/10.1109/VTC2023-Fall60731.2023.10333413
Mhaisen NIosifidis GLeith D(2023)Online Caching With no Regret: Optimistic Learning via RecommendationsIEEE Transactions on Mobile Computing10.1109/TMC.2023.331794323:5(5949-5965)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1109/TMC.2023.3317943
Sun HCui QHuang JQin X(2023)NCache: A Machine-Learning Cache Management Scheme for Computational SSDsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.320876942:6(1810-1823)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TCAD.2022.3208769
Mhaisen NIosifidis GLeith D(2022)Online Caching with Optimistic Learning2022 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking55013.2022.9829806(1-9)Online publication date: 13-Jun-2022
https://doi.org/10.23919/IFIPNetworking55013.2022.9829806
Mhaisen NSinha APaschos GIosifidis G(2022)Optimistic No-regret Algorithms for Discrete CachingProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35706086:3(1-28)Online publication date: 8-Dec-2022
https://dl.acm.org/doi/10.1145/3570608
Shah IJain ALin C(2022)Effective Mimicry of Belady’s MIN Policy2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA53966.2022.00048(558-572)Online publication date: Apr-2022
https://doi.org/10.1109/HPCA53966.2022.00048
Song YFan SXu JLiao J(2022)A Novel Hot-cold Data Identification Mechanism Based on Multidimensional Data2022 5th International Conference on Data Science and Information Technology (DSIT)10.1109/DSIT55514.2022.9943890(1-5)Online publication date: 22-Jul-2022
https://doi.org/10.1109/DSIT55514.2022.9943890
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations