Online Companion Caching

Authors:
Amos Fiat;Manor Mendel;Steven S. Seiden
Affiliations:
-;-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 7
Cited 1

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
On-line restricted caching

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

Online companion caching

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden

Quantified Score

Hi-index	0.01

Visualization

Abstract

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