RACE: A Robust Adaptive Caching Strategy for Buffer Cache, 4th Workshop on Memory Performance Issues (WMPI-2006), held in conjunction with the 12th International Symposium on High-Performance Computer Architecture (HPCA), Austin, Texas, February, 2006, pp. 36-24 (Acceptance rate: 12/27 = 44%).
Abstract
Abstract—While many block replacement algorithms for buffer caches have been proposed to address the wellknown drawbacks of the LRU algorithm, they are not robust and cannot maintain a consistent performance improvement over all workloads. This paper proposes a novel and simple replacement scheme, called RACE, which differentiates the locality of I/O streams by actively detecting access patterns inherently exhibited in two correlated spaces: the discrete block space of program contexts from which I/O requests are issued and the continuous block space within files to which I/O requests are addressed. This scheme combines global I/O regularities of an application and local I/O regularities of individual files accessed in that application to accurately estimate the locality strength, which is crucial in deciding which blocks to be replaced upon a cache miss. Through comprehensive simulations on real-application traces, RACE is shown to significantly outperform LRU and all other state-of-the-art cache management schemes studied in this paper, in terms of absolute hit ratios.
BibTeX Entry
	@inproceedings{zhu_wmpi06, author = {Yifeng Zhu and Hong Jiang}, title = {{RACE}: A Robust Adaptive Caching Strategy for Buffer Cache}, booktitle = {Proceedings of the 4th Workshop on Memory Performance Issues, in conjunction with the 12th International Symposium on High-Performance Computer Architecture ({HPCA})}, year = {2006}, pages={36--24}, publisher = {IEEE Computer Society}, address = {Austin, Texas}, }
Full Paper
pdf
Last modified on October 16, 2007