Competitive paging algorithms
- 1 December 1991
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 12 (4), 685-699
- https://doi.org/10.1016/0196-6774(91)90041-v
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 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