Efficient cooperative caching using hints

Prasenjit Sarkar; John Hartman

doi:10.1145/248155.238741

Efficient cooperative caching using hints

Prasenjit Sarkar
, John Hartman

Computer Science

Research output: Contribution to conference › Paper › peer-review

82 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 language	English (US)
DOIs	https://doi.org/10.1145/248155.238741
State	Published - 1996
Event	2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996 - Seattle, United States Duration: Oct 28 1996 → Oct 31 1996

Conference

Conference	2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996
Country/Territory	United States
City	Seattle
Period	10/28/96 → 10/31/96

ASJC Scopus subject areas

Hardware and Architecture
Information Systems
Computer Networks and Communications

Access to Document

10.1145/248155.238741

Cite this

@conference{f1e77a3088864dd78043882688ff19c0,

title = "Efficient cooperative caching using hints",

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.",

author = "Prasenjit Sarkar and John Hartman",

note = "Funding Information: We would like to thank Mike Dahlin for providing the N-chance simulator and the Sprite trace information, and Mike Feeley for clarifications on the GMS system. Wanda Chiu, Matti Hiltunen, Mudita Jain, Dave Lowenthal, Anup Kuzhiyil and Todd Proebsting all provided much-needed comments on early drafts of this paper, as did the anonymous reviewers. Our paper shepherd, Peter Chen, also deserves thanks for his efforts to improve the paper. This work has been funded in part by the Advanced Research Projects Agency of the Department of Defense under contracts DABT63-94-C-0049 and DABT63-95-C-0075, and a grant from Intel Corporation.; 2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996 ; Conference date: 28-10-1996 Through 31-10-1996",

year = "1996",

doi = "10.1145/248155.238741",

language = "English (US)",

}

TY - CONF

T1 - Efficient cooperative caching using hints

AU - Sarkar, Prasenjit

AU - Hartman, John

N1 - Funding Information: We would like to thank Mike Dahlin for providing the N-chance simulator and the Sprite trace information, and Mike Feeley for clarifications on the GMS system. Wanda Chiu, Matti Hiltunen, Mudita Jain, Dave Lowenthal, Anup Kuzhiyil and Todd Proebsting all provided much-needed comments on early drafts of this paper, as did the anonymous reviewers. Our paper shepherd, Peter Chen, also deserves thanks for his efforts to improve the paper. This work has been funded in part by the Advanced Research Projects Agency of the Department of Defense under contracts DABT63-94-C-0049 and DABT63-95-C-0075, and a grant from Intel Corporation.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85086687574

UR - https://www.scopus.com/pages/publications/85086687574#tab=citedBy

U2 - 10.1145/248155.238741

DO - 10.1145/248155.238741

M3 - Paper

AN - SCOPUS:85086687574

T2 - 2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996

Y2 - 28 October 1996 through 31 October 1996

ER -

Efficient cooperative caching using hints

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this