Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An effective on-chip preloading scheme to reduce data access penalty
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Stride directed prefetching in scalar processors
MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
ICS '93 Proceedings of the 7th international conference on Supercomputing
Efficient simulation of caches under optimal replacement with applications to miss characterization
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
An admission-control technique for delay reduction in proxy caching
Decision Support Systems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
BEAST: a buffer replacement algorithm using spatial and temporal locality
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
BRUST: an efficient buffer replacement for spatial databases
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
| Hi-index | 0.00 |
LRU is the de facto standard page replacement strategy. It is well-known, however, that there are many situations where LRU behaves far from optimal. We present a replacement policy that approximates the optimal algorithm OPT more closely by predicting the time each page will be referenced again and by evicting the page that has the largest predicted time of next reference. Experiments using several benchmarks from the SPEC 2000 benchmark suite show that our algorithm is superior to LRU, in some cases by as much as 25%-30% and in one case by more than 100%.