Feng Zhou, Rob von Behren and Eric Brewer

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-05-1379
April 2005

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/CSD-05-1379.pdf

We present Adaptive Multi-Policy buffer caching (AMP), which uses multiple caching policies within one application, and adapts both which policies to use and their relative fraction of the cache. AMP differentiates disk requests based on the program contexts that issue them, and detects access pattern for each program context. This approach leads to detected patterns more stable than previous approaches that do detection based on processes and files. Compared to recent work, AMP is unique in that it employs a novel robust scheme for detecting looping patterns in access streams, as well as a low-overhead randomized way of managing many cache partitions. We show that AMP outperforms non-detection-based caching algorithms on a variety of workloads. For example, AMP reduces cache miss rate by up to 50% on a large database workloads. Other applications show about 20%-30% reduction in cache miss rate. Compared to other detection-based schemes, AMP detects access patterns more accurately in our experiment with a series of synthesized workloads, and incurs up to 15% fewer misses for one of the application traces. Experience with a Linux implementation is reported. Our prototype shortens the run time of a large database workload by 9.6%.

BibTeX citation:

@techreport{Zhou:CSD-05-1379,
    Author = {Zhou, Feng and von Behren, Rob and Brewer, Eric},
    Title = {Program Context Specific Buffer Caching with AMP},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2005},
    Month = {Apr},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/5223.html},
    Number = {UCB/CSD-05-1379},
    Abstract = {We present Adaptive Multi-Policy buffer caching (AMP), which uses multiple caching policies within one application, and adapts both which policies to use and their relative fraction of the cache. AMP differentiates disk requests based on the program contexts that issue them, and detects access pattern for each program context. This approach leads to detected patterns more stable than previous approaches that do detection based on processes and files. Compared to recent work, AMP is unique in that it employs a novel robust scheme for detecting looping patterns in access streams, as well as a low-overhead randomized way of managing many cache partitions. We show that AMP outperforms non-detection-based caching algorithms on a variety of workloads. For example, AMP reduces cache miss rate by up to 50% on a large database workloads. Other applications show about 20%-30% reduction in cache miss rate. Compared to other detection-based schemes, AMP detects access patterns more accurately in our experiment with a series of synthesized workloads, and incurs up to 15% fewer misses for one of the application traces. Experience with a Linux implementation is reported. Our prototype shortens the run time of a large database workload by 9.6%.}
}

EndNote citation:

%0 Report
%A Zhou, Feng
%A von Behren, Rob
%A Brewer, Eric
%T Program Context Specific Buffer Caching with AMP
%I EECS Department, University of California, Berkeley
%D 2005
%@ UCB/CSD-05-1379
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/5223.html
%F Zhou:CSD-05-1379