Online Companion Caching
数据结构与算法
2007-05-23 v1
摘要
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).
关键词
引用
@article{arxiv.cs/0406036,
title = {Online Companion Caching},
author = {Manor Mendel and Steven S. Seiden},
journal= {arXiv preprint arXiv:cs/0406036},
year = {2007}
}
备注
17 pages, 1 figure. Preliminary version in ESA '02. To be published in Theoretical Computer Science A