article

Randomized competitive algorithms for the list update problem

Authors:

Jeffery Westbrook,

Daniel D. SleatorAuthors Info & Claims

Algorithmica, Volume 11, Issue 1

Pages 15 - 32

https://doi.org/10.1007/BF01294261

Published: 01 January 1994 Publication History

Abstract

We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only during an initialization phase, and from then on runs completely deterministically. It is the first randomized competitive algorithm with this property to beat the deterministic lower bound. We generalize our approach to a model in which access costs are fixed but update costs are scaled by an arbitrary constantd. We prove lower bounds for deterministic list update algorithms and for randomized algorithms against oblivious and adaptive on-line adversaries. In particular, we show that for this problem adaptive on-line and adaptive off-line adversaries are equally powerful.

References

[1]

N. Alon, R. M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. Proc. DIMACS Workshop on On-line Algorithms, pages 1-10. American Mathematical Society, Providence, RI, 1991.

[2]

S. Ben-David, A. Borodin, R. M. Karp, G. Tárdos, and A. Wigderson. On the power of randomization in on-line algorithms. Proc. 20th ACM Symp. on Theory of Computing, pages 379-386, 1990.

[3]

J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pages 179-187, 1990.

Digital Library

[4]

J. L. Bentley and C. C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Comm. ACM, 28(4):404-411, 1985.

Digital Library

[5]

J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. Wei. A locally adaptive data compression scheme. Comm. ACM, 29(4):320-330, 1986.

Digital Library

[6]

D.L. Black and D. D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989.

[7]

A. Borodin, N. Linial, and M. Saks. An optimal on-line algorithm for metrical task systems. Proc. 19th ACM Symp. on Theory of Computing, pages 373-382, 1987.

Digital Library

[8]

P. J. Burville and J. F. C. Kingman. On a model for storage and search. J. Appl. Probab., 10:697-701, 1973.

[9]

M. Chrobak and L. Larmore. On fast algorithms for two servers. J. Algorithms, 12:607-614, 1991.

Digital Library

[10]

M. Chrobak, L. L. Larmore, N. Reingold, and J. Westbrook. Optimal multiprocessor migration algorithms using work functions. Technical Report YALEU/DCS/TR-897, Department of Computer Science, Yale University, 1991.

[11]

S.D. Conte and C. de Boor. Elementary Numerical Analysis, An Algorithmic Approach, 3rd edn. McGraw-Hill, New York, 1980.

[12]

D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random walks on weighted graphs, and applications to on-line algorithms. Proc. 20th ACM Symp. on Theory of Computing, pages 369-377, 1990.

Digital Library

[13]

A. Fiat, R. Karp, M. Luby, L. McGeoch, D. D. Sleator, and N. Young. On competitive algorithms for paging problems. J. Algorithms, 12:685-699, 1991.

Digital Library

[14]

M. J. Golin. Ph.D. thesis, Department of Computer Science, Princeton University, 1990. Technical Report CS-TR-266-90.

[15]

W. J. Hendricks. An account of self-organizing systems. SIAM J. Comput., 5(4): 715-723, 1976.

[16]

S. Irani. Two results on the list update problem. Inform. Process. Lett., 38:301-306, 1991.

Digital Library

[17]

S. Irani, N. Reingold, J. Westbrook, and D. D. Sleator. Randomized algorithms for the list update problem. Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pages 251-260, 1991.

[18]

A.R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive randomized algorithms for non-uniform problems. Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, 1990.

Digital Library

[19]

A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.

Digital Library

[20]

M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for on-line problems. Proc. 20th ACM Symp. on Theory of Computing, pages 322-333, 1988.

Digital Library

[21]

J. McCabe. On serial files with relocatable records. Oper. Res., 13:609-618, 1965.

Digital Library

[22]

P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. Research Report RC 15622 (No. 69444), IBM T. J. Watson Reseach Center, 1990.

[23]

N. Reingold and J. Westbrook. Optimum off-line algorithms for the list update problem. Technical Report YALEU/DCS/TR-805, Yale University, 1990.

[24]

R. Rivest. On self-organizing sequential search heuristics. Comm. ACM, 19(2):63-67, 1976.

Digital Library

[25]

D.D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202-208, 1985.

Digital Library

[26]

J. Westbrook. Randomized algorithms for multiprocessor page migration. Proc. DIMACS Workshop on On-Line Algorithms, pages 135-150. American Mathematical Society, Providence, RI, 1991.

Cited By

Feder ERathod IShyamsukha PSama RAksenov VSalem ISchmid S(2022)Lazy Self-Adjusting Bounded-Degree Networks for the Matching ModelIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796885(1089-1098)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796885
Feder ERathod IShyamsukha PSama RAksenov VSalem ISchmid SAgrawal KAzar Y(2021)Toward Self-Adjusting Networks for the Matching ModelProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461824(429-431)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461824
Angelopoulos SDorrigiv RLópez-Ortiz A(2019)On the Separation and Equivalence of Paging Strategies and Other Online AlgorithmsAlgorithmica10.1007/s00453-018-0461-281:3(1152-1179)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00453-018-0461-2
Show More Cited By

Randomized competitive algorithms for the list update problem
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic reasoning algorithms
2. Theory of computation

Recommendations

A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems

A lower bound of $\Omega(\sqrt{\log k / \log \log k})$ is proved for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (having at least k+1 points) and ...
Improved Randomized On-Line Algorithms for the List Update Problem

The best randomized on-line algorithms known so far for the list update problem achieve a competitiveness of $\sqrt{3} \approx 1.73$. In this paper we present a new family of randomized on-line algorithms that beat this competitive ratio. Our improved ...
Competitive randomized algorithms for nonuniform problems

Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms. In some cases randomization can lead to algorithms with improved performance ratios on worst-case sequences. In this paper ...

Comments

Information & Contributors

Information

Published In

cover image Algorithmica

Algorithmica Volume 11, Issue 1

January 1994

91 pages

ISSN:0178-4617

Issue’s Table of Contents

Copyright © Copyright © 1994 Springer-Verlag New York Inc.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1994

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Feder ERathod IShyamsukha PSama RAksenov VSalem ISchmid S(2022)Lazy Self-Adjusting Bounded-Degree Networks for the Matching ModelIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796885(1089-1098)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796885
Feder ERathod IShyamsukha PSama RAksenov VSalem ISchmid SAgrawal KAzar Y(2021)Toward Self-Adjusting Networks for the Matching ModelProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461824(429-431)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461824
Angelopoulos SDorrigiv RLópez-Ortiz A(2019)On the Separation and Equivalence of Paging Strategies and Other Online AlgorithmsAlgorithmica10.1007/s00453-018-0461-281:3(1152-1179)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00453-018-0461-2
Al-Bawani KEnglert MWestermann M(2018)Comparison-Based Buffer Management in QoS SwitchesAlgorithmica10.1007/s00453-017-0393-280:3(1073-1092)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1007/s00453-017-0393-2
Ambühl C(2017)SIGACT News Online Algorithms Column 31ACM SIGACT News10.1145/3138860.313887148:3(68-82)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3138860.3138871
Boyar JKamali SLarsen KLpez-Ortiz A(2017)On the list update problem with adviceInformation and Computation10.1016/j.ic.2016.06.007253:P3(411-423)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.06.007
(2016)On list update with locality of referenceJournal of Computer and System Sciences10.1016/j.jcss.2015.11.00582:5(627-653)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.jcss.2015.11.005
Dorrigiv REhmsen MLópez-Ortiz A(2015)Parameterized Analysis of Paging and List Update AlgorithmsAlgorithmica10.1007/s00453-013-9800-571:2(330-353)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s00453-013-9800-5
Bienkowski MKraska ASchmidt P(2015)A Randomized Algorithm for Online Scheduling with Interval ConflictsPost-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 943910.1007/978-3-319-25258-2_7(91-103)Online publication date: 14-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-319-25258-2_7
Boyar JKamali SLarsen KLópez-Ortiz A(2014)On the List Update Problem with AdviceProceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 837010.1007/978-3-319-04921-2_17(210-221)Online publication date: 10-Mar-2014
https://dl.acm.org/doi/10.1007/978-3-319-04921-2_17
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents