{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:52:25Z","timestamp":1693857145630},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2011,10]]},"abstract":"\n In this article, we propose a new cache replacement policy that makes the replacement decision based on the reuse information of the cache lines and the requested data. We present the architectural support and evaluate the performance of our approach using SPEC benchmarks. We also develop two reuse information predictors: a profile-based static predictor and a runtime predictor. The applicability of each predictor is discussed in this paper. We further extend our reuse information predictors so that the cache can\n adaptively<\/jats:italic>\n choose between the reuse information based replacement policy and an approximation of LRU policy. According to the experimental results, our adaptive reuse information based replacement policy performs either better than or close to the LRU policy. Our experiments show that L2 cache misses are reduced by 12.32% and 19.95% using the profiling-based static and runtime adaptive predictors respectively.\n <\/jats:p>","DOI":"10.1145\/2019608.2019613","type":"journal-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T13:01:58Z","timestamp":1318942918000},"page":"1-30","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic access distance driven cache replacement"],"prefix":"10.1145","volume":"8","author":[{"given":"Min","family":"Feng","sequence":"first","affiliation":[{"name":"University of California, Riverside, CA"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[{"name":"University of California, Riverside, CA"}]},{"given":"Changhui","family":"Lin","sequence":"additional","affiliation":[{"name":"University of California, Riverside, CA"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, CA"}]}],"member":"320","published-online":{"date-parts":[[2011,10,18]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Annual International Symposium on Computer Architecture.","author":"Alameldeen A. R.","unstructured":"Alameldeen , A. R. and Wood , D. A . 2004. Adaptive cache compression for high-performance processors . In Proceedings of the Annual International Symposium on Computer Architecture. Alameldeen, A. R. and Wood, D. A. 2004. Adaptive cache compression for high-performance processors. In Proceedings of the Annual International Symposium on Computer Architecture."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646667.700030"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.374.0547"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299051"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the JILP Workshop on Computer Architecture Competitions.","author":"Gao H.","unstructured":"Gao , H. and Wilkerson , C . 2010. A dueling segmented LRU replacement algorithm with adaptive bypassing . In Proceedings of the JILP Workshop on Computer Architecture Competitions. Gao, H. and Wilkerson, C. 2010. A dueling segmented LRU replacement algorithm with adaptive bypassing. In Proceedings of the JILP Workshop on Computer Architecture Competitions."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/224538.224622"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89740-8_15"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054907.1054914"},{"key":"e_1_2_1_11_1","unstructured":"HP. 2002. Inside the Intel Itanium 2 processor. Tech. white paper HP. HP. 2002. Inside the Intel Itanium 2 processor. Tech. white paper HP."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454145"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815971"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/379240.379268"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the IEEE International Conference on Computer Design.","author":"Keramidas G.","unstructured":"Keramidas , G. , Petoumenos , P. , and Kaxiras , S . 2007. Cache replacement based on reuse-distance prediction . In Proceedings of the IEEE International Conference on Computer Design. Keramidas, G., Petoumenos, P., and Kaxiras, S. 2007. Cache replacement based on reuse-distance prediction. In Proceedings of the IEEE International Conference on Computer Design."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.24"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.41"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/379240.379259"},{"key":"e_1_2_1_20_1","unstructured":"Lin W. and Reinhardt S. 2002. Predicting last-touch references under optimal replacement. Tech. rep. CSE-TR-447-02 University of Michigan. Lin W. and Reinhardt S. 2002. Predicting last-touch references under optimal replacement. Tech. rep. CSE-TR-447-02 University of Michigan."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237173"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.982916"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/139669.139727"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250709"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.14"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.820037"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.16"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the Annual ACM\/IEEE International Symposium on Microarchitecture.","author":"Tyson G.","unstructured":"Tyson , G. , Farrens , M. , Matthews , J. , and Pleszkun , A. R . 1995. A modified approach to data cache management , In Proceedings of the Annual ACM\/IEEE International Symposium on Microarchitecture. Tyson, G., Farrens, M., Matthews, J., and Pleszkun, A. R. 1995. A modified approach to data cache management, In Proceedings of the Annual ACM\/IEEE International Symposium on Microarchitecture."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques.","author":"Wang Z.","unstructured":"Wang , Z. , McKinley , K. S. , Rosenberg , A. L. , and Weems , C. C . 2002. Using the compiler to improve cache replacement decisions . In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. Wang, Z., McKinley, K. S., Rosenberg, A. L., and Weems, C. C. 2002. Using the compiler to improve cache replacement decisions. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the International Symposium on High-Performance Computer Architecture.","author":"Wong W. A.","unstructured":"Wong , W. A. and Baer , J . -L. 2000. Modified LRU policies for improving second-level cache behavior . In Proceedings of the International Symposium on High-Performance Computer Architecture. Wong, W. A. and Baer, J.-L. 2000. Modified LRU policies for improving second-level cache behavior. In Proceedings of the International Symposium on High-Performance Computer Architecture."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/859618.859629"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2019608.2019613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:32:48Z","timestamp":1672345968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2019608.2019613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2019608.2019613"],"URL":"https:\/\/doi.org\/10.1145\/2019608.2019613","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
