Online companion caching

M. Mendel, Steven S. Seiden

Research output: Contribution to journalArticlepeer-review


This paper is concerned with online caching algorithms for the (n,k)-companion cache, defined by Brehob et al. (J. Scheduling 6 (2003) 149). 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(lognlogk) and Ω(logn+logk).

Original languageEnglish
Pages (from-to)183-200
Number of pages18
JournalTheoretical Computer Science
Issue number2-3 SPEC. ISS.
StatePublished - 20 Sep 2004
Externally publishedYes

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


  • Caching
  • Online algorithms
  • Paging


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

Cite this