|
USENIX 2nd Symposium on
OS Design and Implementation (OSDI '96)
Efficient Cooperative Caching using Hints
Prasenjit Sarkar and
John Hartman
University of Arizona
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.
- Talk slides
-
Full paper
-
SWARM project home page
- Software:
-
Source code
The software represents the sources of the simulators used
to generate the results presented in the paper. More elaborately,
the software contains the source code for the hint-based, GMS,
optimal and global LRU simulators. The source code for the
N-chance simulator can be obtained from
Mike Dahlin
(dahlin@cs.utexas.edu).
-
Sprite Block Access Traces
These traces are derived from the study of the Sprite file system as
presented in SOSP'91. There are five traces, the first three being
48 hours long and the last two 24 hours long. Acknowledgements must go
to Mike Dahlin for providing the traces.
- View the full text of this paper in
HTML and
POSTSCRIPT (225,672 Bytes) form.
- To Become a USENIX Member, please see our
Membership Information.
|
Need help? Use our Contacts page.
Conference Index