Competitive paging algorithms
References (17)
- et al.
Competitive algorithms for server problems
J. Algorithms
(1990) - et al.
A competitive 3-server algorithm
- et al.
An optimal online algorithm for metrical task systems
- A. Borodin, M. Linial, and M. Saks, An optimal online algorithm for metrical task systems, J. ACM, to...
- et al.
New results on server problems
SIAM J. Discrete Math.
(1991) - et al.
An optimal online algorithm for k servers on trees
SIAM J. Comput.
(1991) - et al.
Random walks on weighted graphs and applications to on-line algorithms
- et al.
Competitive k-server algorithms
There are more references available in the full text version of this article.
Cited by (0)
- 1
Support was provided by a Weizmann fellowship.
- 2
Partial support was provided by the International Computer Science Institute, Berkeley, CA, and by NSF Grant CCR-8411954.
- 3
Support was provided by the International Computer Science Institute and operating grant A8092 of the Natural Sciences and Engineering Research Council of Canada. Current address: International Computer Science Institute, Berkeley, CA 94704.
- 4
Partial support was provided by DARPA, ARPA order 4976, Amendment 20, monitored by the Air Force Avionics Laboratory under Contract F33615-87-C-1499, and by the National Science Foundation under Grant CCR-8658139.
- 5
Part of this work was performed while the author was at the Digital Equipment Corp. Systems Research Center, Palo Alto, CA.
Copyright © 1991 Published by Elsevier Inc.