{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T14:47:50Z","timestamp":1782571670625,"version":"3.54.5"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["DEEPGREEN \/ ANR-23-DEGR-0001"],"award-info":[{"award-number":["DEEPGREEN \/ ANR-23-DEGR-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["HOLIGRAIL \/ ANR-23-PEIA-0010"],"award-info":[{"award-number":["HOLIGRAIL \/ ANR-23-PEIA-0010"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["2217154"],"award-info":[{"award-number":["2217154"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>Optimizing for data cache memories is a difficult problem for a compiler, and an important performance bottleneck. Indeed, the behavior of a cache is complex to model statically, due to the cache policies (associativity, eviction policy), and the complex interplay with the mechanisms of a superscalar microarchitecture. Many analytical cache models exist that predict the number of cache misses at compile time, which is pertinent information for optimization. However, there is a compromise between the precision of the model, coverage of input programs, and the model\u2019s analysis time. For example, using a fully-associative analytical cache model is one such compromise: precision is sacrificed by assuming full associativity, but the model is fast and applicable to any affine program.<\/jats:p>\n                  <jats:p>\n                    This article introduces a new cache model, called SARCASM (Set-Associative Rotating Cache Analytical\/Simulating Model), representing a new and useful compromise, which is pertinent in the context of sampling over optimization choices (called\n                    <jats:italic toggle=\"yes\">configurations<\/jats:italic>\n                    ). This was previously limited to fully-associative cache models. SARCASM is a set-associative cache model and can thus model conflict misses and achieve better precision than fully-associative cache models. It is targeted at code structures that arise with optimized implementations of tensor operations such as matrix multiplication, convolution, tensor contraction, arising in machine learning applications. These may feature several levels of tiling, but with only hyper-rectangular tile shapes. Importantly, it is fast enough to be applied at compile time.\n                  <\/jats:p>\n                  <jats:p>\n                    The SARCASM cache model is based on the notion of\n                    <jats:italic toggle=\"yes\">detailed footprint<\/jats:italic>\n                    , a natural generalization of the notion of footprint of existing models that considers the footprint for each cache set. Once the detailed footprint is computed for each loop level, it uses a fully associative model for each cache set to obtain the number of cache misses per cache set. We show that the predictions of this model induce an ordering of configurations much closer to that of measured cache misses than a fully-associative model. We also show that it correlates much better with execution time compared to a fully-associative model.\n                  <\/jats:p>","DOI":"10.1145\/3815112","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:07:54Z","timestamp":1778584074000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Analytical Modeling of Set-Associative Caches for Optimizing Tensor Operations"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0326-1807","authenticated-orcid":false,"given":"Guillaume","family":"Iooss","sequence":"first","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG","place":["Grenoble, France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8308-8682","authenticated-orcid":false,"given":"Christophe","family":"Guillon","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG","place":["Grenoble, France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6589-9956","authenticated-orcid":false,"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG","place":["Grenoble, France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8866-5343","authenticated-orcid":false,"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[{"name":"Google Inc","place":["Paris, France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4737-2034","authenticated-orcid":false,"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"Computer Science & Engineering, The University of Utah","place":["Salt Lake City, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,27]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2012.11.003"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378859"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS61025.2024.00013"},{"key":"e_1_3_2_7_2","unstructured":"Jan Edler and Mark D. Hill. 1999. Dinero IV Trace-Driven Uniprocessor Cache Simulator. Retrieved from https:\/\/pages.cs.wisc.edu\/markhill\/DineroIV\/Last accessed 26 February 2024."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.1999.807544"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1183947"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/325478.325479"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1356052.1356053"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314606"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/901358"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.805152"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908123"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000011388.54204.8e"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2003.1240655"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356218"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1034774.1034777"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523714"},{"key":"e_1_3_2_22_2","unstructured":"Phil Mucci Shirley Moore Christine Deane and George Ho. 1999. PAPI: A Portable Interface to Hardware Performance Counters. 8 pages. Retrieved from https:\/\/icl.utk.edu\/papi\/"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3462213"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454103"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656452"},{"key":"e_1_3_2_26_2","unstructured":"Louis-No\u00ebl Pouchet and Tomofumi Yuki. 2016. PolyBench\/C: The polyhedral benchmark suite version 4.2. Retrieved from http:\/\/polybench.sf.net"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2008.5213293"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.5555\/1153923.1154542"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3558003"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28652-0_6"},{"key":"e_1_3_2_31_2","unstructured":"Gemini Team Rohan Anil Sebastian Borgeaud Jean-Baptiste Alayrac Jiahui Yu Radu Soricut Johan Schalkwyk Andrew M. Dai and Anja Hauth et al. 2025. Gemini: A Family of Highly Capable Multimodal Models. arXiv:2312.11805. Retrieved from https:\/\/arxiv.org\/abs\/2312.11805"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/183019.183047"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3570641"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/254180.254184"},{"issue":"3","key":"e_1_3_2_35_2","first-page":"33","article-title":"BLIS: A framework for rapidly instantiating BLAS functionality","volume":"41","author":"Zee Field G. Van","year":"2015","unstructured":"Field G. Van Zee and Robert A. van de Geijn. 2015. BLIS: A framework for rapidly instantiating BLAS functionality. ACM Transactions on Mathematical Software 41, 3, Article 14 (2015), 33 pages.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/353939"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1275296"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3815112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T14:16:52Z","timestamp":1782569812000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3815112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,27]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3815112"],"URL":"https:\/\/doi.org\/10.1145\/3815112","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,27]]},"assertion":[{"value":"2025-04-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}