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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.
L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78–101, 1966.
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.
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.
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.
A. Karlin, M. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.
L. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816–825, 1991.
D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.
A. Seznec. A case for two-way skewed-associative caches. In Proc. of the 20th International Symposuim on Computer Architecture pages 169–178, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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