Skip to main content
SpringerLink
Log in

Parameterized Analysis of Paging and List Update Algorithms

  • Conference paper
Book cover Approximation and Online Algorithms (WAOA 2009)

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

Included in the following conference series:

Abstract

It is well-established that input sequences for paging and list update have locality of reference. In this paper we analyze the performance of algorithms for these problems in terms of the amount of locality in the input sequence. We define a measure for locality that is based on Denning’s working set model and express the performance of well known algorithms in term of this parameter. This introduces parameterized-style analysis to online algorithms. The idea is that rather than normalizing the performance of an online algorithm by an (optimal) offline algorithm, we explicitly express the behavior of the algorithm in terms of two more natural parameters: the size of the cache and Denning’s working set measure. This technique creates a performance hierarchy of paging algorithms which better reflects their intuitive relative strengths. Also it reflects the intuition that a larger cache leads to a better performance. We obtain similar separation for list update algorithms. Lastly, we show that, surprisingly, certain randomized algorithms which are superior to MTF in the classical model are not so in the parameterized case, which matches experimental results.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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(3), 682–693 (1998)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  3. Albers, S., Lauer, S.: 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.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 96–107. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: On the separation and equivalence of paging strategies. In: Proc. SODA, pp. 229–237 (2007)

    Google Scholar 

  5. Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: List update with locality of reference. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 399–410. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Angelopoulos, S., Schweitzer, P.: Paging and list update under bijective analysis. In: Proc. SODA, pp. 1136–1145 (2009)

    Google Scholar 

  7. Bachrach, R., El-Yaniv, R.: Online list accessing algorithms and their applications: Recent empirical evidence. In: Proc. SODA, pp. 53–62 (1997)

    Google Scholar 

  8. Becchetti, L.: Modeling locality: A probabilistic analysis of LRU and FWF. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 98–109. Springer, Heidelberg (2004)

    Google Scholar 

  9. Ben-David, S., Borodin, A.: A new measure for the study of on-line algorithms. Algorithmica 11, 73–91 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  12. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proc. SODA, pp. 1106–1114 (2008)

    Google Scholar 

  13. Boyar, J., Ehmsen, M.R., Larsen, K.S.: Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 95–107. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. In: Proc. Italian Conf. on Algorithms and Complexity (2003)

    Google Scholar 

  15. Chrobak, M., Noga, J.: LRU is better than FIFO. Algorithmica 23(2), 180–185 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Denning, P.J.: The working set model for program behaviour. CACM 11(5), 323–333 (1968)

    Google Scholar 

  17. Denning, P.J.: Working sets past and present. IEEE Transactions on Software Engineering SE-6(1), 64–84 (1980)

    Article  Google Scholar 

  18. Denning, P.J.: The locality principle. CACM 48(7), 19–24 (2005)

    Google Scholar 

  19. Dorrigiv, R., López-Ortiz, A.: A survey of performance measures for on-line algorithms. SIGACT News 36(3), 67–81 (2005)

    Article  Google Scholar 

  20. Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12, 685–699 (1991)

    Article  MATH  Google Scholar 

  21. Fiat, A., Rosen, Z.: Experimental studies of access graph based heuristics: Beating the LRU standard? In: Proc. SODA, pp. 63–72 (1997)

    Google Scholar 

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

    Article  Google Scholar 

  23. Iacono, J.: Improved upper bounds for pairing heaps. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 32–45. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Iacono, J.: Alternatives to splay trees with O(log n) worst-case access times. In: Proc. SODA, pp. 516–522 (2001)

    Google Scholar 

  25. Irani, S., Karlin, A.R., Phillips, S.: Strongly competitive algorithms for paging with locality of reference. SIAM Journal on Computing 25, 477–497 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  26. Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM Journal on Computing 30(3), 906–922 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  27. Kenyon, C.: Best-fit bin-packing with random order. In: Proc. SODA, pp. 359–364 (1996)

    Google Scholar 

  28. Koutsoupias, E., Papadimitriou, C.: Beyond competitive analysis. SIAM Journal on Computing 30, 300–317 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  29. O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Proc. ACM SIGMOD Conf., pp. 297–306 (1993)

    Google Scholar 

  30. Reingold, N., Westbrook, J.: Randomized algorithms for the list update problem. Technical Report YALEU/DCS/TR-804, Yale University (June 1990)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  32. Schulz, F.: Two new families of list update algorithms. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 99–108. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  33. Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts. John Wiley & Sons, Chichester (2002)

    Google Scholar 

  34. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. CACM 28, 202–208 (1985)

    MathSciNet  Google Scholar 

  35. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. JACM 32(3), 652–686 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  36. N.M.S. University: Homepage of new mexico state university tracebase (online), http://tracebase.nmsu.edu/tracebase.html

  37. Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)

    Article  MathSciNet  Google Scholar 

  38. Young, N.E.: On-line paging against adversarially biased random inputs. Journal of Algorithms 37(1), 218–235 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  39. Young, N.E.: Online file caching. Algorithmica 33(3), 371–383 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Canada

    Reza Dorrigiv & Alejandro López-Ortiz

  2. Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark

    Martin R. Ehmsen

Authors
  1. Reza Dorrigiv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin R. Ehmsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alejandro López-Ortiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Place des Terasses, Tour Evry 2, 91000, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dorrigiv, R., Ehmsen, M.R., López-Ortiz, A. (2010). Parameterized Analysis of Paging and List Update Algorithms. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12450-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12449-5

  • Online ISBN: 978-3-642-12450-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation