Skip to main content
SpringerLink
Log in

On List Update with Locality of Reference

  • Conference paper
Automata, Languages and Programming (ICALP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5125))

Included in the following conference series:

Abstract

We present a comprehensive study of the list update problem with locality of reference. More specifically, we present a combined theoretical and experimental study in which the theoretically proven and experimentally observed performance guarantees of algorithms match or nearly match. In the first part of the paper we introduce a new model of locality of reference that is based on the natural concept of runs. Using this model we develop refined theoretical analyses of popular list update algorithms. The second part of the paper is devoted to an extensive experimental study in which we have tested the algorithms on traces from benchmark libraries. It shows that the theoretical and experimental bounds differ by just a few percent. Our new bounds are substantially lower than those provided by standard competitive analysis. Another result is that the elegant Move-To-Front strategy exhibits the best performance, which confirms that it is the method of choice in practice.

Work supported by the German Research Foundation, projects AL 464/4-2 and 5-1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S.: Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing 27, 670–681 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Albers, S., Favrholdt, L.M., Giel, O.: On paging with locality of reference. Journal of Computer and System Sciences 70, 145–175 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Albers, S., von Stengel, B., Werchner, R.: A combined BIT and TIMESTAMP algorithm for the list update problem. Information Processing Letters 56, 135–139 (1995)

    Article  MATH  Google Scholar 

  4. Ambühl, C.: Offline List update is NP-hard. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 42–51. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Ambühl, C., Gärtner, B., von Stengel, B.: A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science 268, 3–16 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: List update with locality of reference: MTF outperforms all other algorithms. Technical Report CS-2006-46, School of Computer Science, University of Waterloo (2006)

    Google Scholar 

  7. Bachrach, R., El-Yaniv, R.: Online list accessing algorithms and their applications: Recent empirical evidence. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 53–62 (1997)

    Google Scholar 

  8. Bachrach, R., El-Yaniv, R., Reinstädtler, M.: On the competitive theory and practice of online list accessing algorithms. Algorithmica 32, 201–245 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bentley, J.L., McGeoch, C.C.: Amortized analyses of self-organizing sequential search heuristics. Communication of the ACM 28, 404–411 (1985)

    Article  Google Scholar 

  10. Bentley, J.L., Sleator, D.S., Tarjan, R.E., Wei, V.K.: A locally adaptive data compression scheme. Communications of the ACM 29, 320–330 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. Journal of Computer and System Sciences 50, 244–258 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. DEC SRC Research Report 124 (1994)

    Google Scholar 

  13. Calgary Corpus, http://links.uwaterloo.ca/calgary.corpus.html

  14. The Canterbury Corpus, http://corpus.canterbury.ac.nz/

  15. Fiat, A., Mendel, M.: Truly online paging with locality of reference. In: Proc. 38rd Annual Symposium on Foundations of Computer Science, pp. 326–335 (1997)

    Google Scholar 

  16. Hester, J.H., Hirschberg, D.S.: Self-organizing linear search. ACM Computing Surveys 17, 295–312 (1985)

    Article  Google Scholar 

  17. Irani, S.: Two results on the list update problem. Information Processing Letters 38, 301–306 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Karlin, A., Phillips, S., Raghavan, P.: Markov paging. In: Proc. 33rd Annual Symposium on Foundations of Computer Science, pp. 24–27 (1992)

    Google Scholar 

  19. Karp, R., Raghavan, P.: Personal communication cisted in [22] (1990)

    Google Scholar 

  20. Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. In: Proc. 35th Annual Symposium on Foundations of Computer Science, pp. 394–400 (1994)

    Google Scholar 

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

    Google Scholar 

  22. Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica 11, 15–32 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rivest, R.: On self-organizing sequential search heuristics. Communications of the ACM 19, 63–67 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  24. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers & Sonja Lauer

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sonja Lauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Luca Aceto

  2. Department of Computer Science, IT-Parken, University of Aarhus, Ã…bogade 34, 8200, Ã…rhusN, Denmark

    Ivan Damgård

  3. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, UK

    Leslie Ann Goldberg

  4. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavik, Iceland

    Magnús M. Halldórsson

  5. Department of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Anna Ingólfsdóttir

  6. Université de Bordeaux-1, LaBRI, 351, Cours de la Libération, 33405, Talence cedex, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S., Lauer, S. (2008). On List Update with Locality of Reference. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70575-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70574-1

  • Online ISBN: 978-3-540-70575-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation