Hint-based Cooperative Caching

DMCA

Hint-based Cooperative Caching (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Prasenjit Sarkar , John H. Hartman

Venue:	ACM Transactions on Computer Systems
Citations:	17 - 0 self

BibTeX

@ARTICLE{Sarkar00hint-basedcooperative,
    author = {Prasenjit Sarkar and John H. Hartman},
    title = {Hint-based Cooperative Caching},
    journal = {ACM Transactions on Computer Systems},
    year = {2000},
    volume = {18},
    pages = {387--419}
}

OpenURL

Abstract

This paper presents the design, implementation, and measurement of a hint-based cooperative caching file system. Hints allow a decentralized approach to cooperative caching that provides performance comparable to that of existing tightly-coordinated algorithms such as N-chance and GMS, but incurs 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 15, block lookup traffic by nearly a factor of two-thirds, and replacement traffic by more than a factor of 5. We also implemented a hint-based cooperative caching file system and measured its performance with real users over the period of one week. Hint-based cooperative caching reduced the average block access time to almost half that of NFS. Moreover, our system exhibited reduced overhead and high hint accuracy as predicted by the simulations. 1 Introduction Caching is an essential element of distributed file systems...

Keyphrases

hint-based cooperative caching hint-based cooperative caching file system decentralized approach block access time block lookup traffic distributed file system manager load tightly-coordinated algorithm essential element introduction caching high hint accuracy real user average block access time replacement traffic

DMCA