Thek-server dual and loose competitiveness for paging
- 1 June 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 11 (6) , 525-541
- https://doi.org/10.1007/bf01189992
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Multiprocessor cache analysis using ATUMPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the power of randomization in on-line algorithmsAlgorithmica, 1994
- Competitive paging algorithmsJournal of Algorithms, 1991
- 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 paging with locality of referencePublished by Association for Computing Machinery (ACM) ,1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985