EELRU: Simple and effective adaptive page replacement

Performance Evaluation Review

Volumn 27, Issue 1, 1999, Pages 122-133

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

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MANAGEMENT INFORMATION SYSTEMS; STORAGE ALLOCATION (COMPUTER);

EARLY EVICTION LEAST RECENTLY USED (EELRU); VIRTUAL MEMORY MANAGEMENT SYSTEMS;

VIRTUAL STORAGE;

EID: 0032688350     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301464.301486     Document Type: Conference Paper

References (16)

1. A.V. Aho, P.J. Denning, and J.D. Ullman, "Principles of Optimal Page Replacement", in JACM 18 pp.80-93 (1971).
2. O. Babaoglu and D. Ferrari, "Two-Level Replacement Decisions in Paging Stores", IEEE Transactions on Computers, 32(12) (1983).
3. M.H.J. Baylis, D.G. Fletcher, and D.J. Howarth, "Paging Studies Made on the I.C.T. ATLAS Computer", Information Processing 1968, IFIP Congress Booklet D (1968).
4. P.J. Courtois and H. Vantilborgh, "A Decomposable Model of Program Paging Behavior", Acta Informatica, 6 pp.251-275 (1976)
5. P.J. Denning, "Working Sets Past and Present", IEEE Transactions on Software Engineering, SE-6(1) pp.64-84 (1980).
6. E.B. Fernandez, T. Lang, and C. Wood, "Effect of Replacement Algorithms on a Paged Buffer Database System", IBM Journal of Research and Development, 22(2) pp.185-196 (1978).
7. M.A. Franklin and R.K. Gupta, "Computation of pf Probabilities from Program Transition Diagrams", CACM 17 pp.186-191 (1974).
8. G. Glass and P. Cao, "Adaptive Page Replacement Based on Memory Reference Behavior", Proc. SIGMETRICS '97.
9. A.R. Karlin, S.J. Phillips, and P. Raghavan, "Markov Paging", in Proc. IEEE Symposium on the Foundations of Computer Science (FOCS) pp.208-217 (1992).
10. V. Phalke, Modeling and Managing Program References in a Memory Hierarchy, Ph.D. Dissertation, Rutgers University (1995).
11. D.D. Sleator and R.E. Tarjan, "Amortized Efficiency of List Update and Paging Rules", Communications of the ACM 28(2), pp.202-208 (1985).
12. J.R. Spirn, "Distance String Models for Program Behavior", Computer, 9 pp.14-20 (1976).
13. E. Torng, "A Unified Analysis of Paging and Caching", Algorithmica 20, pp.175-200 (1998).
14. R. Turner and H. Levy, "Segmented FIFO Page Replacement", In Proc. SIGMETRICS (1981).
15. P.R. Wilson, S. Kakkad, and S.S. Mukherjee, "Anomalies and Adaptation in the Analysis and Development of Prefetching Policies", Journal of Systems and Software 27(2):147-153, November 1994. Technical communication.
16. C. Wood, E.B. Fernandez, and T. Lang, "Minimization of Demand Paging for the LRU Stack Model of Program Behavior", Information Processing Letters, 16 pp.99-104 (1983).