Abstract
This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm can use more pages; in the second, it is allowed to have a lookahead, or in other words, some partial knowledge of the future. The paper considers a new measure for the lookahead size as well as Young's resource-bounded lookahead and proves that both measures have the attractive property that the competitive efficiency of an on-line algorithm with k extra pages and lookahead l depends on k+l. Hence, under these measures, an on-line algorithm has the same benefit from using an extra page or knowing an extra bit of the future.
Partially supported by the ESPRIT Basic Research Action Program of the EC under contract #7141 (ALCOM II).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. The Influence of Lookahead in Competitive Paging Algorithms. In Proc. 1st European Symposium on Algorithms, number 726 in Lecture Notes in Computer Science, pages 1–12. Springer-Verlag, Berlin, Germany, 1993.
L.A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78–101, 1966.
S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11:73–91, 1994.
A. Fiat, R. Karp, M. Luby, L. McGeoch, D.D. Sleator, and N.E. Young. Competitive Paging Algorithms. J. Algorithms, 12:685–699, 1991.
E.F. Grove. Online Bin Packing with Lookahead. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pages 430–436, 1995.
E. Koutsoupias. On-Line Algorithms and the k-server Conjecture. PhD thesis, Dept. of Computer Science and Engineering, University of California, San Diego, 1994.
E. Koutsoupias and C.H. Papadimitriou. Beyond Competitive Analysis. In Proc. 35th IEEE Symp. on Foundations of Computer Science, pages 394–400, 1994.
L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816–825, 1991.
D.D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Comm. of the ACM, 28(2):202–208, 1985.
E. Torng. A Unified Analysis of Paging and Caching. In Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995. To appear.
N. Young. Competitive Paging and Dual-Guided On-Line Weighted Caching and Matching Algorithms. PhD thesis, Dept. of Computer Science, Princeton University, 1991.
N. Young. On-Line Caching as Cache Size Varies. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pages 241–250, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Breslauer, D. (1996). On competitive on-line paging with lookahead. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_48
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive