Sciweavers

Share
CORR
2004
Springer

Online Companion Caching

9 years 10 months ago
Online Companion Caching
This paper is concerned with online caching algorithms 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).
Manor Mendel, Steven S. Seiden
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors Manor Mendel, Steven S. Seiden
Comments (0)
books