Abstract
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list update problem using these models. In addition to lower bounds we present a number of competitive on-line algorithms with lookahead.
This work was supported by a Graduiertenkolleg graduate fellowship of the Deutsche Forschungsgemeinschaft.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Albeis. The influence of lookahead in competitive paging algorithms. In Proc. of the 1st Annual European Symposium on Algorithms, pages 1–12, 1993.
S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, special issue on on-line algorithms, 11(1):73–91, 1994.
J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM, 28(4):404–411, 1985.
F.K. Chung, R. Graham and M.E. Saks. A dynamic location problem for graphs. Combinatorica, 9(2):111–131, 1989.
M.M. Halldórsson and M. Szegedy. Lower bounds for on-line graph coloring. In Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211–216, 1992.
S. Irani. Coloring inductive graphs on-line. In Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, pages 470–479, 1990.
S. Irani, N. Reingold, J. Westbrook and D.D. Sleator. Randomized competitive algorithms for the list update problem. In Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 251–260, 1991.
M.-Y. Kao and S.R. Tate. Online matching with blocked input. Information Processing Letters, 38:113–116, May 1991.
R. Karp and P. Raghavan. Personal communication, transmitted through [IRWS91].
D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.
N. Young. Competitive Paging and Dual-Guided On-Line Weighted Caching and Matching Algorithms. Ph.D. thesis, Princeton University, 1991. Available as Computer Science Department Technical Report CS-TR-348-91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S. (1994). A Competitive analysis of the list update problem with lookahead. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_67
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive