Issue No. 06 - November/December (2002 vol. 14)
<p><b>Abstract</b>—In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative and noncooperative replacement algorithms. We draw five conclusions from these experiments: 1) Cooperative placement can significantly improve performance compared to local replacement algorithms, particularly when the size of individual caches is limited compared to the universe of objects; 2) although the <it>amortizing placement</it> algorithm is only guaranteed to be within <tmath>14</tmath> times the optimal, in practice it seems to provide an excellent approximation of the optimal; 3) in a cooperative caching scenario, the recent <it>greedy-dual</it> local replacement algorithm performs much better than the other local replacement algorithms; 4) our <it>hierarchical-greedy-dual</it> replacement algorithm yields further improvements over the greedy-dual algorithm especially when there are idle caches in the system; and 5) a key challenge to coordinated placement algorithms is generating good predictions of access patterns based on past accesses.</p>
Cache, cooperative, distributed, hierarchical, placement, replacement, web.
Michael Dahlin, Madhukar R. Korupolu, "Coordinated Placement and Replacement for Large-Scale Distributed Caches", IEEE Transactions on Knowledge & Data Engineering, vol. 14, no. , pp. 1317-1329, November/December 2002, doi:10.1109/TKDE.2002.1047770