.png){kind=icon}
.png){kind=icon}
Return
Calculating lower bounds for caching problems
.png){kind=icon}
OA
AI
DOI：10.1007/s00607-007-0230-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For weighted caching, we increase the interval of weights where FIFO is known to be optimal. For companion caching, we give much simpler proofs for several known results, and give a new bound for the case of three types without reorganization or bypassing.
Keywords:
paging
on-line
caching