Online companion caching

Authors:
M. Mendel;Steven S. Seiden
Affiliations:
Department of Computer Science, School of Engineering and Computer Science, The Hebrew University, Jerusalem 91904, Israel;Department of Computer Science, Louisiana State University, Baton Rouge
Venue:
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Year:
2004

Citing 8
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive paging algorithms

Journal of Algorithms
A case for two-way skewed-associative caches

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Competitive analysis of randomized paging algorithms

Theoretical Computer Science
Online Companion Caching

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal Replacement Is NP-Hardfor Nonstandard Caches

IEEE Transactions on Computers
On-line restricted caching

Journal of Scheduling - Special issue: On-line algorithm part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(log n log k) and Ω(log n + log k).