Efficient cooperative caching using hints

Prasenjit Sarkar, John Hartman

Research output: Contribution to conferencePaper

70 Scopus citations

Abstract

We present a very low-overhead decentralized algorithm for cooperative caching that provides performance comparable to that of existing centralized algorithms. Unlike existing algorithms that rely on centralized control of cache functions, our algorithm uses hints (i.e. inexact information) to allow clients to perform these functions in a decentralized fashion. This paper shows that a hint-based system performs as well as a more tightly coordinated system while requiring less overhead. Simulations show that the block access times of our system are as good as those of the existing tightly-coordinated algorithms, while reducing manager load by more than a factor of 15, block lookup traffic by nearly a factor of two-thirds, and replacement traffic by more than a factor of 5.

Original languageEnglish (US)
DOIs
StatePublished - 1996
Event2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996 - Seattle, United States
Duration: Oct 28 1996Oct 31 1996

Conference

Conference2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996
CountryUnited States
CitySeattle
Period10/28/9610/31/96

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient cooperative caching using hints'. Together they form a unique fingerprint.

  • Cite this

    Sarkar, P., & Hartman, J. (1996). Efficient cooperative caching using hints. Paper presented at 2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996, Seattle, United States. https://doi.org/10.1145/248155.238741