Skip to main content
SpringerLink
Log in

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis

  • Conference paper
Algorithm Theory – SWAT 2012 (SWAT 2012)

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

Included in the following conference series:

Abstract

Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families of graphs which grow with the length of the sequences.

Partially supported by the Danish Council for Independent Research.

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., von Stengel, B., Werchner, R.: A combined BIT and TIMESTAMP algorithm for the list update problem. Inform. Proc. Letters 56, 135–139 (1995)

    Article  MATH  Google Scholar 

  2. Albers, S., Westbrook, J.: Self-Organizing Data Structures. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms 1996. LNCS, vol. 1442, pp. 13–51. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. ACM Transactions on Algorithms 3(2), article no. 22 (2007)

    Google Scholar 

  7. Boyar, J., Favrholdt, L.M., Larsen, K.S.: The relative worst order ratio applied to paging. Journal of Computer and System Sciences 73(5), 818–843 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Boyar, J., Gupta, S., Larsen, K.S.: Access graphs results for LRU versus FIFO under relative worst order analysis, arXiv:1204.4047v1 [cs.DS] (2012)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  12. 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 

  13. Ehmsen, M.R., Kohrt, J.S., Larsen, K.S.: List Factoring and Relative Worst Order Analysis. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 118–129. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Fiat, A., Karlin, A.R.: Randomized and multipointer paging with locality of reference. In: 27th Annual ACM Symposium on Theory of Computing, pp. 626–634 (1995)

    Google Scholar 

  15. Fiat, A., Mendel, M.: Truly online paging with locality of reference. In: 38th Annual Symposium on Foundations of Computer Science, pp. 326–335 (1997), extended version: CoRR, abs/cs/0601127 (2006)

    Google Scholar 

  16. Fiat, A., Rosen, Z.: Experimental studies of access graph based heuristics: Beating the LRU standard? In: 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 63–72 (1997)

    Google Scholar 

  17. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Systems Tech. Journal 45(9), 1563–1581 (1966)

    Google Scholar 

  18. Irani, S., Karlin, A.R., Phillips, S.: Strongly competitive algorithms for paging with locality of reference. SIAM J. Comput. 25(3), 477–497 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3, 79–119 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  21. Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput. 30(3), 906–922 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Southern Denmark, Odense, Denmark

    Joan Boyar, Sushmita Gupta & Kim S. Larsen

Authors
  1. Joan Boyar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sushmita Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim S. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Department of Information and Computer Science, Aalto University, PO Box 15400, 00076, Aalto, Finland

    Petteri Kaski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boyar, J., Gupta, S., Larsen, K.S. (2012). Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31155-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31154-3

  • Online ISBN: 978-3-642-31155-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation