Abstract
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 language | English |
|---|---|
| Title of host publication | Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings |
| Editors | Rolf Möhring, Rajeev Raman |
| Publisher | Springer Verlag |
| Pages | 499-511 |
| Number of pages | 13 |
| ISBN (Electronic) | 3540441808, 9783540441809 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
| Event | 10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy Duration: 17 Sep 2002 → 21 Sep 2002 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2461 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 10th Annual European Symposium on Algorithms, ESA 2002 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 17/09/02 → 21/09/02 |
Bibliographical note
Funding Information:Preliminary version of this paper appeared in [7]. ∗Corresponding author. E-mail address: [email protected] (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.