Abstract
The randomized k-paging algorithm Equitable given by Achlioptas et al. is H k -competitive and uses O(k 2 logk) memory. This competitive ratio is best possible. The randomized algorithm RMark given by Fiat et al. is (2H k − 1)-competitive, but only uses O(k) memory. Borodin and El Yaniv [6] list as an open question whether there exists an H k -competitive randomized algorithm which requires O(k) memory for k-paging. In this paper we answer this question in the affirmative by giving a modification of Equitable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoret. Comput. Sci. 234, 203–218 (2000)
Bein, W., Fleischer, R., Larmore, L.L.: Limited bookmark randomized online algorithms for the paging problem. Inform. Process. Lett. 76, 155–162 (2000)
Bein, W., Larmore, L.L.: Trackless online algorithms for the server problem. Inform. Process. Lett. 74, 73–79 (2000)
Bein, W., Larmore, L.L., Reischuk, R.: Knowledge state algorithms: Randomization with limited information(2007) Arxiv: archive.org/cs/0701142
Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78–101 (1966)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Fiat, A., Karp, R., Luby, M., McGeoch, L.A., Sleator, D., Young, N.E.: Competitive paging algorithms. J. Algorithms 12, 685–699 (1991)
Koutsoupias, E., Papadimitriou, C.: Beyond competitive analysis. In: FOCS. Proc. 35th Symp. Foundations of Computer Science, pp. 394–400. IEEE, Los Alamitos (1994)
Koutsoupias, E., Papadimitriou, C.: Beyond competitive analysis. SIAM J. Comput. 30, 300–317 (2000)
McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6(6), 816–825 (1991)
Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bein, W., Larmore, L.L., Noga, J. (2007). Equitable Revisited. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)