Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2002: Algorithms — ESA 2002 pp 499–511Cite as

Online Companion Caching

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2461))

Abstract

This paper is concerned with online cachingalg orithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way set-associative cache and a companion fully-associative cache of size n. We show that the deterministic competitive ratio for this problem is (n+1)(k+1) -1, and the randomized competitive ratio is O(log n log k) and Ω(log n + log k).

This research was partially supported by the Louisiana Board of Regents Research Competitiveness Subprogram and by AFOSR grant No. F49620-01-1-0264.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  2. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78–101, 1966.

    Article  Google Scholar 

  3. M. Brehob, R. Enbody, E. Torng, and S. Wagner. On-line restricted caching. In Proceedings of the 12th Symposium on Discrete Algorithms, pages 374–383, 2001.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  5. N. Jouppi. Improvingdi rect-mapped cache by the addition of small fullyassociative cache and prefetch buffer. Proc. of the 17th International Symposiuom on Computer Architecture, 18(2):364–373, 1990.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. L. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816–825, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  8. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.

    Article  MathSciNet  Google Scholar 

  9. A. Seznec. A case for two-way skewed-associative caches. In Proc. of the 20th International Symposuim on Computer Architecture pages 169–178, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel-Aviv University, USA

    Amos Fiat

  2. School of Computer Science, The Hebrew University, USA

    Manor Mendel

  3. Department of Computer Science, Louisiana State University, Baton Rouge

    Steven S. Seiden

Authors
  1. Amos Fiat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manor Mendel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven S. Seiden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Rolf Möhring

  2. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Rajeev Raman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiat, A., Mendel, M., Seiden, S.S. (2002). Online Companion Caching. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45749-6_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44180-9

  • Online ISBN: 978-3-540-45749-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation