Online Companion Caching
<|reference_start|>Online Companion Caching: 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).<|reference_end|>
@article{mendel2004online,
    title={Online Companion Caching},
    author={Manor Mendel, Steven S. Seiden},
    journal={Theoret. Comput. Sci. 324(2-3): 183-200, 2004},
    year={2004},
    doi={10.1016/j.tcs.2004.05.015},
    archivePrefix={arXiv},
    eprint={cs/0406036},
    primaryClass={cs.DS}
}