Abstract
Caches do not grow in size at the speed of main memory or raw processor performance. Therefore, optimal use of the limited cache resources is of paramount importance to obtain a good system performance. Instead of a recency-based replacement policy (such as, e.g., LRU), we can also make use of a locality-based policy, based on the temporal reuse of data. These replacement policies have usually been constructed to operate in a cache with multiple modules, some of them dedicated to data showing high temporal reuse, and some of them dedicated to data showing low temporal reuse. In this paper, we show how locality-based replacement policies can be adapted to operate in set-associative and skewed-associative [8] caches. In order to understand the benefits of locality-based replacement policies, they are compared to recency-based replacement policies, something that has not been done before.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kenneth K. Chan, Cyrus C. Hay, John R. Keller, Gordon P. Kurpanek, Francis X. Schumacher, and Jason Zheng. Design of the HP PA 7200 CPU. Hewlett-Packard Journal, 47(1), February 1996. 317
A. Gonzalez, C. Aliagas, and M. Valero. A data cache with multiple caching strategies tuned to different types of locality. In ICS’95. Proceedings of the 9th ACM International Conference on Supercomputing, pages 338–347, 1995. 316
T. Horel and G. Lauterbach. UltraSPARC-III: Designing third-generation 64-bit performance. IEEE Micro, 19(3):73–85, May 1999. 317
J. A. Rivers and E. S. Davidson. Reducing conflicts in direct-mapped caches with a temporality-based design. In Proceedings of the 1996 International Conference on Parallel Processing, volume 1, pages 154–163, August 1996. 316
J. A. Rivers, E. S. Tam, G. S. Tyson, E. S. Davidson, and M. Farrens. Uitilizing reuse information in data cache management. In ICS’98. Proceedings of the 1998 International Conference on Supercomputing, pages 449–456, 1998. 313, 316
F. Jesús Sánchez, Antonio González, and Mateo Valero. Software management of selective and dual data caches. IEEE Technical Committee on Computer Architecture Newsletter, pages 3–10, March 1997. 316
Jesús Sánchez,, and Antonio González. A locality sensitive multi-module cache with explicit management. In ICS’99. Proceedings of the 1999 International Conference on Supercomputing, pages 51–59, Rhodes, Greece, June 1999. 316
A. Seznec. A case for two-way skewed associative caches. In Proceedings of the 20th Annual International Symposium on Computer Architecture, pages 169–178, May 1993. 310, 312
A. Seznec. A new case for skewed-associativity. Technical Report PI-1114, IRISA, July 1997. 312
A. Seznec and Francois Bodin. Skewed-associative caches. In PARLE’93: Parallel Architectures and Programming Languages Europe, pages 305–316, Munich, Germany, June 1993. 312, 314, 315
Alan Jay Smith. Cache memories. ACM Computing Surveys, 14(3):473–530, September 1982. 312
Amitabh Srivastava and Alan Eustace. ATOM: A system for building customized program analysis tools. Technical Report 94/2, Western Research Laboratory, March 1994. 314
Edward S. Tam. Improving Cache Performance Via Active Management. PhD thesis, University of Michigan, 1999. 313
Steven J. E. Wilton and Norman E. Jouppi. An enhanced access and cycle time model for on-chipcac hes. Technical Report 93/5, Western Research Laboratory, July 1994. 314
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vandierendonck, H., Bosschere, K.D. (2000). A Comparison of Locality-Based and Recency-Based Replacement Policies. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-39999-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41128-4
Online ISBN: 978-3-540-39999-5
eBook Packages: Springer Book Archive