General Caching Is Hard: Even with Small Pages
- 19 August 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 79 (2) , 319-339
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Grantová Agentura České Republiky (CZ) (P202/12/G061, 14-10003S)
This publication has 19 references indexed in Scilit:
- Randomized Competitive Algorithms for Generalized CachingSIAM Journal on Computing, 2012
- Caching Is Hard—Even in the Fault ModelAlgorithmica, 2011
- Resource allocation with time intervalsTheoretical Computer Science, 2010
- Page Replacement with Multi-Size Pages and Applications to Web CachingAlgorithmica, 2002
- On-Line File CachingAlgorithmica, 2002
- A unified approach to approximating resource allocation and schedulingJournal of the ACM, 2001
- A better lower bound on the competitive ratio of the randomized 2-server problemInformation Processing Letters, 1997
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991