Hint-based cooperative caching

Prasenjit Sarkar, John H. Hartman

Research output: Contribution to journalArticle

42 Scopus citations

Abstract

This article presents the design, implementation, and measurement of a hint-based cooperative caching file system. Hints allow clients to make decisions based on local state, enabling a loosely coordinated system that is simple to implement. The resulting performance is comparable to that of existing tightly coordinated algorithms that use global state, but with less overhead. Simulations show that the block access times of our system are as good as those of the existing algorithms, while reducing manager load by more than a factor of seven, block lookup traffic by nearly a factor of two-thirds, and replacement traffic a factor of five. To verify our simulation results in a real system with real users, we implemented a prototype and measured its performance for one week. Although the simulation and prototype environments were very different, the prototype system mirrored the simulation results by exhibiting reduced overhead and high hint accuracy. Furthermore, hint-based cooperative caching reduced the average block access time to almost half that of NFS.

Original languageEnglish (US)
Pages (from-to)387-419
Number of pages33
JournalACM Transactions on Computer Systems
Volume18
Issue number4
DOIs
StatePublished - Nov 2000

Keywords

  • Algorithms
  • Cooperative caching
  • D.4.3 [Operating Systems]
  • Design
  • File Systems Management
  • Hints
  • Measurement
  • Performance

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Hint-based cooperative caching'. Together they form a unique fingerprint.

  • Cite this