{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:07Z","timestamp":1763466487971,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>One important trend in today's microprocessor architectures is the increase in size of the processor caches. These caches also tend to be set associative. As technology scales, process variations are expected to increase the fault rates of the SRAM cells that compose such caches. As an important component of the processor, the parametric yield of SRAM cells is crucial to the overall performance and yield of the microchip. In this article, we propose a microarchitectural solution, called the buddy cache that permits large, set-associative caches to tolerate faults in SRAM cells due to process variations. In essence, instead of disabling a faulty cache block in a set (as is the current practice), it is paired with another faulty cache block in the same set\u2014the buddy. Although both cache blocks are faulty, if the faults of the two blocks do not overlap, then instead of losing two blocks, buddying will yield a functional block from the nonfaulty portions of the two blocks. We found that with buddying, caches can better mitigate the negative impacts of process variations on performance and yield, gracefully downgrading performance as opposed to catastrophic failure. We will describe the details of the buddy cache and give insights as to why it is both more performance and yield resilient to faults.<\/jats:p>","DOI":"10.1145\/1543753.1543757","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:28:33Z","timestamp":1247074113000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Tolerating process variations in large, set-associative caches"],"prefix":"10.1145","volume":"6","author":[{"given":"Cheng-Kok","family":"Koh","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}]},{"given":"Weng-Fai","family":"Wong","sequence":"additional","affiliation":[{"name":"National University of Singapore"}]},{"given":"Yiran","family":"Chen","sequence":"additional","affiliation":[{"name":"Seagate Technology LLC"}]},{"given":"Hai","family":"Li","sequence":"additional","affiliation":[{"name":"Seagate Technology LLC"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.840407"},{"key":"e_1_2_1_2_1","first-page":"958","article-title":"Cache array defect functional bypassing using repair mask","volume":"5","author":"Arimilli R. K.","year":"1999","unstructured":"Arimilli , R. K. , Dodson , J. S. , Lewis , J. D. , and Skergan , T. M. 1999 . Cache array defect functional bypassing using repair mask . U.S. Patent Number 5 , 958 ,068. Arimilli, R. K., Dodson, J. S., Lewis, J. D., and Skergan, T. M. 1999. Cache array defect functional bypassing using repair mask. U.S. Patent Number 5,958,068.","journal-title":"U.S. Patent Number"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2005.110"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775920"},{"volume-title":"Proceedings of the IEEE Custom Integrated Circuits Conference. 201--204","author":"Cao Y.","key":"e_1_2_1_5_1","unstructured":"Cao , Y. , Sato , T. , Sylvester , D. , Orshansky , M. , and Hu , C . 2000. New paradigm of predictive MOSFET and interconnect modeling for early circuit design . In Proceedings of the IEEE Custom Integrated Circuits Conference. 201--204 . Cao, Y., Sato, T., Sylvester, D., Orshansky, M., and Hu, C. 2000. New paradigm of predictive MOSFET and interconnect modeling for early circuit design. In Proceedings of the IEEE Custom Integrated Circuits Conference. 201--204."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996695"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.278"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5194\/ars-5-321-2007"},{"key":"e_1_2_1_9_1","first-page":"145","article-title":"Cache memory having flags for inhibiting rewrite of replacement algorithm area corresponding to fault cell and information processing system having such a cache memory","volume":"6","author":"Fujimoto Y.","year":"2000","unstructured":"Fujimoto , Y. 2000 . Cache memory having flags for inhibiting rewrite of replacement algorithm area corresponding to fault cell and information processing system having such a cache memory . U.S. Patent Number 6 , 145 ,055. Fujimoto, Y. 2000. Cache memory having flags for inhibiting rewrite of replacement algorithm area corresponding to fault cell and information processing system having such a cache memory. U.S. Patent Number 6,145,055.","journal-title":"U.S. Patent Number"},{"key":"e_1_2_1_10_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J. L.","year":"2006","unstructured":"Hennessy , J. L. and Patterson , D. A . 2006 . Computer Architecture: A Quantitative Approach 4 th Ed. Morgan-Kaufmann , San Francisco, CA . Hennessy, J. L. and Patterson, D. A. 2006. Computer Architecture: A Quantitative Approach 4th Ed. Morgan-Kaufmann, San Francisco, CA.","edition":"4"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2006.130"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2007.81"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233587"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065588"},{"key":"e_1_2_1_15_1","first-page":"666","article-title":"Method and system for bypassing a faulty line of data or its associated tag of a set associative cache memory","volume":"5","author":"McClure D.","year":"1997","unstructured":"McClure , D. 1997 . Method and system for bypassing a faulty line of data or its associated tag of a set associative cache memory . U.S. Patent Number 5 , 666 ,482. McClure, D. 1997. Method and system for bypassing a faulty line of data or its associated tag of a set associative cache memory. U.S. Patent Number 5,666,482.","journal-title":"U.S. Patent Number"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/16.333844"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382534"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.52"},{"key":"e_1_2_1_19_1","unstructured":"Pellston 2006. Intel's newest Quad Xeon MP versus HP's DL585 Quad Opteron. http:\/\/www.anandtech.com\/cpuchipsets\/intel\/showdoc.aspx?i=2872&p=2.  Pellston 2006. Intel's newest Quad Xeon MP versus HP's DL585 Quad Opteron. http:\/\/www.anandtech.com\/cpuchipsets\/intel\/showdoc.aspx?i=2872&p=2."},{"volume-title":"Proceedings of the 34th International Symposium on Micro-Architecture (MICRO-34)","author":"Powell M. D.","key":"e_1_2_1_20_1","unstructured":"Powell , M. D. , Agarwal , A. , Vijaykumar , T. N. , Falsafi , B. , and Roy , K . 2001. Reducing set-associative cache energy via way-prediction and selective direct-mapping . In Proceedings of the 34th International Symposium on Micro-Architecture (MICRO-34) . 54--65. Powell, M. D., Agarwal, A., Vijaykumar, T. N., Falsafi, B., and Roy, K. 2001. Reducing set-associative cache energy via way-prediction and selective direct-mapping. In Proceedings of the 34th International Symposium on Micro-Architecture (MICRO-34). 54--65."},{"key":"e_1_2_1_21_1","volume-title":"Digital Integrated Circuits: A Design Perspective","author":"Rabaey J. M.","unstructured":"Rabaey , J. M. , Chandrakasan , A. , and Nikoli &cgrave;, B. 2003. Digital Integrated Circuits: A Design Perspective 2 nd Ed. Prentice-Hall , Upper Saddle River, NJ. Rabaey, J. M., Chandrakasan, A., and Nikoli&cgrave;, B. 2003. Digital Integrated Circuits: A Design Perspective 2nd Ed. Prentice-Hall, Upper Saddle River, NJ.","edition":"2"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/832299.836546"},{"key":"e_1_2_1_23_1","unstructured":"SimpleScalar LLC. The SimpleScalar toolset. http:\/\/www.simplescalar.com.  SimpleScalar LLC. The SimpleScalar toolset. http:\/\/www.simplescalar.com."},{"volume-title":"Performance Evaluation Corp. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000","author":"Standard","key":"e_1_2_1_24_1","unstructured":"Standard Performance Evaluation Corp. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000 . Standard Performance Evaluation Corp. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000."},{"key":"e_1_2_1_25_1","unstructured":"Tarjan D. Thoziyoor S. and Jouppi N. P. 2006. CACTI 4.0. Tech. rep. HP Western Research Labs.  Tarjan D. Thoziyoor S. and Jouppi N. P. 2006. CACTI 4.0. Tech. rep. HP Western Research Labs."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065780"},{"key":"e_1_2_1_27_1","unstructured":"University of Minnesota ARCTiC Labs. Minnespec: A new SPEC benchmark workload for simulation-based computer architecture research. http:\/\/www.arctic.umn.edu\/minnespec\/index.shtml.  University of Minnesota ARCTiC Labs. Minnespec: A new SPEC benchmark workload for simulation-based computer architecture research. http:\/\/www.arctic.umn.edu\/minnespec\/index.shtml."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1394608.1382139"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.85"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061267.1061270"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543753.1543757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1543753.1543757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:20Z","timestamp":1750253420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543753.1543757"}},"subtitle":["The buddy cache"],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1145\/1543753.1543757"],"URL":"https:\/\/doi.org\/10.1145\/1543753.1543757","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2009,6]]},"assertion":[{"value":"2008-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}