The EELRU adaptive replacement algorithm

Performance Evaluation

Volumn 53, Issue 2, 2003, Pages 93-123

  Smaragdakis, Yannis ^a   Kaplan, Scott ^b   Wilson, Paul ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b AMHERST COLLEGE   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

LRU; Memory management; Replacement algorithms; Virtual memory

Indexed keywords

ADAPTIVE ALGORITHMS; PROGRAM PROCESSORS; VIRTUAL STORAGE;

MEMORY MANAGEMENT;

STORAGE ALLOCATION (COMPUTER);

EID: 0037683142     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00226-2     Document Type: Article

References (22)

1. Aho A.V., Denning P.J., Ullman J.D., Principles of optimal page replacement. J. ACM. 18:1971;80-93.
2. O. Babaoglu, D. Ferrari, Two-level replacement decisions in paging stores, IEEE Trans. Comput. 32 (12) 1983.
3. M.H.J. Baylis, D.G. Fletcher, D.J. Howarth, Paging studies made on the ICT ATLAS computer, in: Information Processing, IFIP Congress Booklet, vol. D, 1968.
4. Courtois P.J., Vantilborgh H., A decomposable model of program paging behavior. Acta Inform. 6:1976;251-275.
5. Denning P.J., Working sets past and present. IEEE Trans. Software Eng. 6(1):1980;64-84.
6. Fernandez E.B., Lang T., Wood C., Effect of replacement algorithms on a paged buffer database system. IBM J. Res. Dev. 22(2):1978;185-196.
7. Franklin M.A., Gupta R.K., Computation of pf probabilities from program transition diagrams. Commun. ACM. 17:1974;186-191.
8. G. Glass, P. Cao, Adaptive page replacement based on memory reference behavior, in: Proceedings of ACM SIGMETRICS'97, 1997.
9. S. Jiang, X. Zhang, LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance, in: Proceedings of ACM SIGMETRICS'02, 2002.
10. A.R. Karlin, S.J. Phillips, P. Raghavan, Markov paging, in: Proceedings of the IEEE Symposium on the Foundations of Computer Science, FOCS, 1992, pp. 208-217.
11. D.C. Lee, P.J. Crowley, J.L. Baer, T.E. Anderson, B.N. Bershad, Execution characteristics of desktop applications on windows NT, in: Proceedings of the International Symposium on Computer Architecture (ISCA)'98, 1998.
12. Mattson R.L., Gecsei J., Slutz D.R., Traiger I.L., Evaluation techniques for storage hierarchies. IBM Syst. J. 9:1970;78-117.
13. Muramatsu H., Negishi H., Page replacement algorithm for large-array manipulation. Software Practice Experience. 10:1980;575-587.
14. V. Phalke, Modeling and managing program references in a memory hierarchy, Ph.D. Dissertation, Rutgers University, 1995.
15. Sleator D.D., Tarjan R.E., Amortized efficiency of list update and paging rules. Commun. ACM. 28(2):1985;202-208.
16. Y. Smaragdakis, S.F. Kaplan, P. Wilson, EELRU: simple and effective adaptive page replacement, in: Proceedings of ACM SIGMETRICS'99, 1999.
17. Y. Smaragdakis, P. Wilson, Performing replacement in modem pools, in: Proceedings of the 2000 USENIX Annual Technical Conference.
18. Spirn J.R., Distance string models for program behavior. Computer. 9:1976;14-20.
19. Torng E., A unified analysis of paging and caching. Algorithmica. 20:1998;175-200.
20. R. Turner, H. Levy, Segmented FIFO page replacement, in: Proceedings of ACM SIGMETRICS'81, 1981
21. Wilson P.R., Kakkad S., Mukherjee S.S., Anomalies and adaptation in the analysis and development of prefetching policies. J. Syst. Software. 27(2):1994;147-153.
22. Wood C., Fernandez E.B., Lang T., Minimization of demand paging for the LRU stack model of program behavior. Inform. Process. Lett. 16:1983;99-104.