On competitive on-line paging with lookahead
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 593-603
- https://doi.org/10.1007/3-540-60922-9_48
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A unified analysis of paging and cachingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new measure for the study of on-line algorithmsAlgorithmica, 1994
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966