Strongly Competitive Algorithms for Paging with Locality of Reference
- 1 June 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (3), 477-497
- https://doi.org/10.1137/s0097539792236353
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Competitive Paging with Locality of ReferenceJournal of Computer and System Sciences, 1995
- Competitive paging algorithmsJournal of Algorithms, 1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- Competitive snoopy cachingAlgorithmica, 1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Working Sets Past and PresentIEEE Transactions on Software Engineering, 1980
- Some Distribution-Free Aspects of Paging Algorithm PerformanceJournal of the ACM, 1974
- Locality in Page Reference StringsSIAM Journal on Computing, 1972
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966
- One-Level Storage SystemIEEE Transactions on Electronic Computers, 1962