Welcome to the ADMT Publication Server

Self-tuning caching: the Universal Caching algorithm

DocUID: 2006-017 Full Text: PDF

Author: Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chrysanthis

Abstract: A cache replacement policy is normally suited to a particular class of applications, or limited to a set of fixed criteria for evaluating the cache-worthiness of an object. We present Universal Caching as a mechanism to capture the generality of the most adaptive algorithms, while depending on a very limited set of basic criteria for cache-replacement decisions. Our testing was limited to Web workloads, where we tested the Universal Caching policy using real-world traces from both the server-side and client-side proxies. Using a self-tuning mechanism, combined with a generalization of the criteria employed in GD-* Web caching, Universal Caching was able to consistently outperform any other fixed choice of algorithm we tested.

Keywords: adaptive, automated, caching, self-tuning; self-optimizing

Published In: Software Practice & Experience

Volume: 36Number: 11-12Pages: 1179 - 1188

Year Published: 2006

Note: DOI:10.1002/spe.v36:11/12

Project: S-CITI Subject Area: Caching

Publication Type: Journal Paper

Sponsor: NSF ITR ANI-0325353

Citation:Text Latex BibTex XML Ganesh Santhanakrishnan, Ahmed Amer, and Panos K. Chrysanthis. Self-tuning caching: the Universal Caching algorithm, Software Practice & Experience (SP&E), 36(11-12):1179 - 1188, 2006.(DOI:10.1002/spe.v36:11/12)