A unified analysis of paging and caching
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 194-203
- https://doi.org/10.1109/sfcs.1995.492476
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- IP over connection-oriented networks and distributional pagingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Beyond Competitive AnalysisSIAM Journal on Computing, 2000
- Strongly Competitive Algorithms for Paging with Locality of ReferenceSIAM Journal on Computing, 1996
- Markov pagingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989
- Hierarchical memory with block transferPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Locality in Page Reference StringsSIAM Journal on Computing, 1972