[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2002-14 | ||
| Previous version | 2001-43 | ||
| Submitted on | 25th of February 2002 | ||
| Author | Olston, Chris; Widom, Jennifer | ||
| Title | Best-Effort Cache Synchronization with Source Cooperation | ||
| Date of publication | 4th of June 2002 | ||
| Published in | Proceedings of the ACM SIGMOD 2002 International Conference on Management of Data | ||
| Citation | Olston, Chris; Widom, Jennifer. Best-Effort Cache Synchronization with Source Cooperation, Proceedings of the ACM SIGMOD 2002 International Conference on Management of Data | ||
| Number of pages | 12 | ||
| Language | English | ||
| Project | TRAPP | ||
| Type | Conference or Journal Paper | ||
| Subject group | Distributed Systems | ||
| Abstract | In environments where exact synchronization between source data objects and cached copies is not achievable due to bandwidth or other resource constraints, stale (out-of-date) copies are permitted. It is desirable to minimize the overall divergence between source objects and cached copies by selectively refreshing modified objects. We call the online process of selecting which objects to refresh in order to minimize divergence best-effort synchronization. In most approaches to best-effort synchronization, the cache coordinates the process and selects objects to refresh. In this paper, we propose a best-effort synchronization scheduling policy that exploits cooperation between data sources and the cache. We also propose an implementation of our policy that incurs low communication overhead even in environments with very large numbers of sources. Our algorithm is adaptive to wide fluctuations in available resources and data update rates. Through experimental simulation over synthetic and real-world data, we demonstrate the effectiveness of our algorithm, and we quantify the significant decrease in divergence achievable with source cooperation. | ||
| Keywords | approximate caching, best-effort synchronization | ||
| Contact address | olston@db.stanford.edu | ||
| Sponsored by | This work was supported by the National Science Foundation under grant IIS-9817799 and by a National Science Foundation graduate research fellowship. | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]