{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:03:30Z","timestamp":1776931410586,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,18]]},"DOI":"10.1145\/3725843.3756095","type":"proceedings-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:19:56Z","timestamp":1760721596000},"page":"795-808","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Probabilistic Perspective on Tiling Sparse Tensor Algebra"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5809-7031","authenticated-orcid":false,"given":"Ritvik","family":"Sharma","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5236-2829","authenticated-orcid":false,"given":"Zi Yu","family":"Xue","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9668-902X","authenticated-orcid":false,"given":"Nathan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2268-0074","authenticated-orcid":false,"given":"Rubens","family":"Lacouture","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2267-903X","authenticated-orcid":false,"given":"Fredrik","family":"Kjolstad","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3444-1544","authenticated-orcid":false,"given":"Sara","family":"Achour","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3245-7542","authenticated-orcid":false,"given":"Mark","family":"Horowitz","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523442"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523442"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/CICC63670.2025.10983811"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3490422.3502358"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Stephen Chou Fredrik Kjolstad and Saman Amarasinghe. 2018. Format abstraction for sparse tensor algebra compilers. Proc. ACM Program. Lang. 2 OOPSLA Article 123 (Oct. 2018) 30\u00a0pages. 10.1145\/3276493","DOI":"10.1145\/3276493"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Edith Cohen. 1998. Structure Prediction and Computation of Sparse Matrix Products. Journal of Combinatorial Optimization 2 3 (Dec. 1998) 307\u2013332. 10.1023\/A:1009716300509","DOI":"10.1023\/A:1009716300509"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358276"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis and Yifan Hu. 2011. The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38 1 Article 1 (dec 2011) 25\u00a0pages. 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_1_10_2","unstructured":"SciPy Developers. [n. d.]. Compressed Sparse Row (CSR) Matrix. SciPy documentation. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.sparse.csr_matrix.html Accessed: 2025\/09\/25 19:25:15."},{"key":"e_1_3_3_1_11_2","volume-title":"scipy.sparse.coo_matrix","author":"Developers SciPy","year":"2024","unstructured":"SciPy Developers. 2024. scipy.sparse.coo_matrix. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.sparse.coo_matrix.html Accessed: 2024-11-20."},{"key":"e_1_3_3_1_12_2","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob et\u00a0al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Fred\u00a0G. Gustavson. 1978. Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition. ACM Trans. Math. Softw. 4 3 (sep 1978) 250\u2013269. 10.1145\/355791.355796","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358275"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3623278.3624770"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Rawn Henry Olivia Hsu Rohan Yadav Stephen Chou Kunle Olukotun Saman Amarasinghe and Fredrik Kjolstad. 2021. Compilation of sparse array programming models. Proc. ACM Program. Lang. 5 OOPSLA Article 128 (Oct. 2021) 29\u00a0pages. 10.1145\/3485505","DOI":"10.1145\/3485505"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Yu hsin Chen Tien-Ju Yang Joel\u00a0S. Emer and Vivienne Sze. 2018. Eyeriss v2: A Flexible Accelerator for Emerging Deep Neural Networks on Mobile Devices. IEEE Journal on Emerging and Selected Topics in Circuits and Systems 9 (2018) 292\u2013308. https:\/\/api.semanticscholar.org\/CorpusID:131771552","DOI":"10.1109\/JETCAS.2019.2910232"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582051"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Aamer Jaleel Kevin\u00a0B. Theobald Simon\u00a0C. Steely and Joel Emer. 2010. High performance cache replacement using re-reference interval prediction (RRIP). SIGARCH Comput. Archit. News 38 3 (jun 2010) 60\u201371. 10.1145\/1816038.1815971","DOI":"10.1145\/1816038.1815971"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Fredrik Kjolstad Shoaib Kamil Stephen Chou David Lugato and Saman Amarasinghe. 2017. The tensor algebra compiler. Proc. ACM Program. Lang. 1 OOPSLA Article 77 (oct 2017) 29\u00a0pages. 10.1145\/3133901","DOI":"10.1145\/3133901"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Kalhan Koul Maxwell Strange Jackson Melchert Alex Carsello Yuchen Mei Olivia Hsu Taeyoung Kong Po-Han Chen Jake Ke Keyi Zhang Qiaoyi Liu Gedeon Nyengele Akhilesh Balasingam Jayashree Adivarahan Ritvik Sharma Zhouhua Xie Christopher Torng Joel Emer Fredrik Kjolstad Mark Horowitz and Priyanka Raina. 2024. Onyx: A Programmable Accelerator for Sparse Tensor Algebra. to appear in IEEE Hot Chips Symposium (Hot Chips) (August 2024).","DOI":"10.1109\/HCS61935.2024.10665150"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Eunji Lee Hyokyung Bahn and Sam\u00a0H. Noh. 2014. A Unified Buffer Cache Architecture that Subsumes Journaling Functionality via Nonvolatile Memory. ACM Trans. Storage 10 1 Article 1 (jan 2014) 17\u00a0pages. 10.1145\/2560010","DOI":"10.1145\/2560010"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575706"},{"key":"e_1_3_3_1_24_2","unstructured":"Asit\u00a0K. Mishra Jorge\u00a0Albericio Latorre Jeff Pool Darko Stosic Dusan Stosic Ganesh Venkatesh Chong Yu and Paulius Micikevicius. 2021. Accelerating Sparse Deep Neural Networks. ArXiv abs\/2104.08378 (2021). https:\/\/api.semanticscholar.org\/CorpusID:233296249"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3613424.3623791"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080255"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582064"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00067"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304025"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080256"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Chiara Ravazzi Roberto Tempo and Fabrizio Dabbene. 2018. Learning Influence Structure in Sparse Social Networks. IEEE Transactions on Control of Network Systems 5 4 (2018) 1976\u20131986. 10.1109\/TCNS.2017.2781367","DOI":"10.1109\/TCNS.2017.2781367"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"MMG Ricci and Tullio Levi-Civita. 1900. M\u00e9thodes de calcul diff\u00e9rentiel absolu et leurs applications. Math. Ann. 54 1 (1900) 125\u2013201.","DOI":"10.1007\/BF01454201"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Nathalie\u00a0Henry Riche Jean-Daniel Fekete and Michael\u00a0J. McGuffin. 2007. NodeTrix: a Hybrid Visualization of Social Networks. IEEE Transactions on Visualization and Computer Graphics 13 (2007). https:\/\/api.semanticscholar.org\/CorpusID:8451881","DOI":"10.1109\/TVCG.2007.70582"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480047"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Ryan Senanayake Changwan Hong Ziheng Wang Amalee Wilson Stephen Chou Shoaib Kamil Saman Amarasinghe and Fredrik Kjolstad. 2020. A sparse iteration space transformation framework for sparse tensor algebra. Proc. ACM Program. Lang. 4 OOPSLA Article 158 (nov 2020) 30\u00a0pages. 10.1145\/3428226","DOI":"10.1145\/3428226"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Ritvik Sharma. 2025. D2T2 Compiler. 10.5281\/zenodo.17067445","DOI":"10.5281\/zenodo.17067445"},{"key":"e_1_3_3_1_37_2","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith Shaden","year":"2017","unstructured":"Shaden Smith, Jee\u00a0W. Choi, Jiajia Li, Richard Vuduc, Jongsoo Park, Xing Liu, and George Karypis. 2017. FROSTT: The Formidable Repository of Open Sparse Tensors and Tools. http:\/\/frostt.io\/"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575742"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00096"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3613424.3623793"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446702"}],"event":{"name":"MICRO 2025: 58th IEEE\/ACM International Symposium on Microarchitecture","location":"Seoul Korea","acronym":"MICRO 2025","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 58th IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725843.3756095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T21:44:48Z","timestamp":1769463888000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725843.3756095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":41,"alternative-id":["10.1145\/3725843.3756095","10.1145\/3725843"],"URL":"https:\/\/doi.org\/10.1145\/3725843.3756095","relation":{},"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"2025-10-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}