The EELRU adaptive replacement algorithm

[1]  Pierre-Jacques Courtois,et al.  A decomposable model of program paging behaviour , 2004, Acta Informatica.

[2]  Song Jiang,et al.  LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance , 2002, SIGMETRICS '02.

[3]  Yannis Smaragdakis,et al.  Performing Replacement in Modem Pools , 2000, USENIX Annual Technical Conference, General Track.

[4]  Yannis Smaragdakis,et al.  EELRU: simple and effective adaptive page replacement , 1999, SIGMETRICS '99.

[5]  B. Bershad,et al.  Execution characteristics of desktop applications on Windows NT , 1998, Proceedings. 25th Annual International Symposium on Computer Architecture (Cat. No.98CB36235).

[6]  Pei Cao,et al.  Adaptive page replacement based on memory reference behavior , 1997, SIGMETRICS '97.

[7]  Vidyadhar Phalke,et al.  Modeling and managing program references in a memory hierarchy , 1996 .

[8]  Eric Torng,et al.  A Unified Analysis of Paging and Caching , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9]  Shubhendu S. Mukherjee,et al.  Anomalies and adaptation in the analysis and development of prepaging policies , 1994, J. Syst. Softw..

[10]  Anna R. Karlin,et al.  Markov paging , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[11]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[12]  Domenico Ferrari,et al.  Two-Level Replacement Decisions in Paging Stores , 1983, IEEE Transactions on Computers.

[13]  Tomás Lang,et al.  Minimization of Demand Paging for the LRU Stack Model of Program Behavior , 1983, Inf. Process. Lett..

[14]  Henry M. Levy,et al.  Segmented FIFO page replacement , 1981, SIGMETRICS '81.

[15]  Hiroshi Muramatsu,et al.  Page replacement algorithm for large‐array manipulation , 1980, Softw. Pract. Exp..

[16]  Peter J. Denning,et al.  Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.

[17]  Tomás Lang,et al.  Effect of Replacement Algorithms on a Paged Buffer Database System , 1978, IBM J. Res. Dev..

[18]  Jeffrey R. Spirn,et al.  Distance String Models for Program Behavior , 1976, Computer.

[19]  Mark A. Franklin,et al.  Computation of page fault probability from program transition diagram , 1974, CACM.

[20]  Alfred V. Aho,et al.  Principles of Optimal Page Replacement , 1971, J. ACM.

[21]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[22]  D. J. Howarth,et al.  Paging studies made on the I.C.T. Atlas , 1968, IFIP Congress.