The influence of lookahead in competitive paging algorithms
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Coloring inductive graphs on-linePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Lower bounds for on-line graph coloringPublished by American Mathematical Society (AMS) ,1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- Online matching with blocked inputInformation Processing Letters, 1991
- The harmonic online K-server algorithm is competitivePublished by Association for Computing Machinery (ACM) ,1991
- A Dynamic location problem for graphsCombinatorica, 1989
- Competitive snoopy cachingAlgorithmica, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966