The working set algorithm has competitive ratio less than two
References (19)
- et al.
Competitive paging algorithms
J. Algorithms
(1991) - et al.
Competitive algorithms for server problems
J. Algorithms
(1990) - et al.
Competitive analysis of randomized paging algorithms
A study of replacement algorithms for a virtual storage computer
IBM Syst. J.
(1970)- et al.
On the power of randomization in online algorithms
- et al.
Competitive paging with locality of reference
The working set model for program behavior
Comm. ACM
(1968)Working sets past and present
IEEE Trans. Software Engineering
(1980)- et al.
Competitive k-server algorithms
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1997 Published by Elsevier B.V.