Online companion caching

Amos Fiat, Manor Mendel, Steven S. Seiden

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper is concerned with online cachingalgorithms 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).

Original languageEnglish
Title of host publicationAlgorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
EditorsRolf Möhring, Rajeev Raman
PublisherSpringer Verlag
Number of pages13
ISBN (Electronic)3540441808, 9783540441809
StatePublished - 2002
Externally publishedYes
Event10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy
Duration: 17 Sep 200221 Sep 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th Annual European Symposium on Algorithms, ESA 2002

Bibliographical note

Funding Information:
Preliminary version of this paper appeared in [7]. ∗Corresponding author. E-mail address: (M. Mendel). 1The 'rst named author would like to dedicate this paper in memory of Steven Seiden. 2Partially supported by the Louisiana Board of Regents Research Competitiveness Subprogram

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.


Dive into the research topics of 'Online companion caching'. Together they form a unique fingerprint.

Cite this