TL;DR
This paper analyzes online algorithms for the (n,k)-companion cache, providing bounds on their competitive ratios and advancing understanding of their efficiency in caching scenarios.
Contribution
It establishes the deterministic and randomized competitive ratios for the (n,k)-companion cache problem, a novel analysis in this caching model.
Findings
Deterministic competitive ratio is (n+1)(k+1)-1.
Randomized competitive ratio is O(log n log k).
Lower bound for randomized ratio is Ω(log n + log k).
Abstract
This paper is concerned with online caching algorithms for the (n,k)-companion cache, defined by Brehob et. al. 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 \Omega(\log n +\log k).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.