Online Companion Caching
| dc.creator | Mendel, Manor | |
| dc.creator | Seiden, Steven S. | |
| dc.date | 2004-06-18 | |
| dc.date.accessioned | 2026-07-07T03:21:28Z | |
| dc.date.available | 2026-07-07T03:21:28Z | |
| dc.description | 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 Ω(\log n +\log k). | |
| dc.description | 17 pages, 1 figure. Preliminary version in ESA '02. To be published in Theoretical Computer Science A | |
| dc.identifier | https://arxiv.org/abs/cs/0406036 | |
| dc.identifier | http://arxiv.org/abs/cs/0406036 | |
| dc.identifier | Theoret. Comput. Sci. 324(2-3): 183-200, 2004 | |
| dc.identifier | doi:10.1016/j.tcs.2004.05.015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32204 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Online Companion Caching | |
| dc.type | text |