{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:46:53Z","timestamp":1783036013803,"version":"3.54.6"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["2009007, 2216903, 2217081, 2217154"],"award-info":[{"award-number":["2009007, 2216903, 2217081, 2217154"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>Sparse tensor networks represent contractions over multiple sparse tensors. Tensor contractions are higher-order analogs of matrix multiplication. Tensor networks arise commonly in many domains of scientific computing and data science. Such networks are typically computed using a tree of binary contractions. Several critical inter-dependent aspects must be considered in the generation of efficient code for a contraction tree, including sparse tensor layout mode order, loop fusion to reduce intermediate tensors, and the mutual dependence of loop order, mode order, and contraction order. We propose CoNST, a novel approach that considers these factors in an integrated manner using a single formulation. Our approach creates a constraint system that encodes these decisions and their interdependence, while aiming to produce reduced-order intermediate tensors via fusion. The constraint system is solved by the Z3 SMT solver and the result is used to create the desired fused loop structure and tensor mode layouts for the entire contraction tree. This structure is lowered to the IR of the TACO compiler, which is then used to generate executable code. Our experimental evaluation demonstrates significant performance improvements over current state-of-the-art sparse tensor compiler\/library alternatives.<\/jats:p>","DOI":"10.1145\/3689342","type":"journal-article","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T10:54:58Z","timestamp":1723892098000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["CoNST: Code Generator for Sparse Tensor Networks"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3294-1481","authenticated-orcid":false,"given":"Saurabh","family":"Raje","sequence":"first","affiliation":[{"name":"Kahlert School of Computing, University of Utah, Salt Lake City, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7787-6460","authenticated-orcid":false,"given":"Yufan","family":"Xu","sequence":"additional","affiliation":[{"name":"Kahlert School of Computing, University of Utah, Salt Lake City, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4556-4937","authenticated-orcid":false,"given":"Atanas","family":"Rountev","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Ohio State University, Columbus, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9923-6256","authenticated-orcid":false,"given":"Edward F.","family":"Valeev","sequence":"additional","affiliation":[{"name":"Chemistry, Virginia Tech, Blacksburg, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4737-2034","authenticated-orcid":false,"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"Kahlert School of Computing, University of Utah, Salt Lake City, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.302"},{"key":"e_1_3_3_3_2","article-title":"Finch: Sparse and structured array programming with control flow","author":"Ahrens Willow","year":"2024","unstructured":"Willow Ahrens, Teodoro Fields Collin, Radha Patel, Kyle Deeds, Changwan Hong, and Saman Amarasinghe. 2024. Finch: Sparse and structured array programming with control flow. arXiv preprint arXiv:2404.16730 (2024).","journal-title":"arXiv preprint arXiv:2404.16730"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579990.3580020"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.79.291"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3544559"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.0c00006"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607097"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000176"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512551"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532386"},{"key":"e_1_3_3_14_2","unstructured":"M. J. Frisch G. W. Trucks H. B. Schlegel G. E. Scuseria M. A. Robb J. R. Cheeseman G. Scalmani V. Barone B. Mennucci G. A. Petersson H. Nakatsuji M. Caricato X. Li H. P. Hratchian A. F. Izmaylov J. Bloino G. Zheng J. L. Sonnenberg M. Hada M. Ehara K. Toyota R. Fukuda J. Hasegawa M. Ishida T. Nakajima Y. Honda O. Kitao H. Nakai T. Vreven J. A. Montgomery Jr. J. E. Peralta F. Ogliaro M. Bearpark J. J. Heyd E. Brothers K. N. Kudin V. N. Staroverov R. Kobayashi J. Normand K. Raghavachari A. Rendell J. C. Burant S. S. Iyengar J. Tomasi M. Cossi N. Rega J. M. Millam M. Klene J. E. Knox J. B. Cross V. Bakken C. Adamo J. Jaramillo R. Gomperts R. E. Stratmann O. Yazyev A. J. Austin R. Cammi C. Pomelli J. W. Ochterski R. L. Martin K. Morokuma V. G. Zakrzewski G. A. Voth P. Salvador J. J. Dannenberg S. Dapprich A. D. Daniels \u00d6. Farkas J. B. Foresman J. V. Ortiz J. Cioslowski and D. J. Fox. [n. d.]. Gaussian 09 Revision E.01. Gaussian Inc. Wallingford CT."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1039\/B415208E"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/11428831_20"},{"key":"e_1_3_3_17_2","article-title":"Minimum cost loop nests for contraction of a sparse tensor with a tensor network","author":"Kanakagiri Raghavendra","year":"2023","unstructured":"Raghavendra Kanakagiri and Edgar Solomonik. 2023. Minimum cost loop nests for contraction of a sparse tensor with a tensor network. arXiv preprint arXiv:2307.05740 (2023).","journal-title":"arXiv preprint arXiv:2307.05740"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661182"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661185"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3591268"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356218"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-33601-5"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460355"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441581"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1137\/16M108968X"},{"key":"e_1_3_3_28_2","first-page":"87","volume-title":"International Workshop on Languages and Compilers for Parallel Computing","author":"Mutlu Erdal","year":"2020","unstructured":"Erdal Mutlu, Ruiqin Tian, Bin Ren, Sriram Krishnamoorthy, Roberto Gioiosa, Jacques Pienaar, and Gokcen Kestor. 2020. COMET: A domain-specific compilation of high-performance computational chemistry. In International Workshop on Languages and Compilers for Parallel Computing. Springer, 87\u2013103."},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1063\/5.0004608"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.106"},{"key":"e_1_3_3_31_2","unstructured":"Nvidia. 2020. cuTENSOR: A High-performance CUDA Library for Tensor Primitives. https:\/\/docs.nvidia.com\/cuda\/cutensor\/index.html"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1063\/5.0005889"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.033315"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.4926879"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(83)80703-9"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.4939030"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.35"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2016.031"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00753"},{"key":"e_1_3_3_40_2","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith Shaden","year":"2017","unstructured":"Shaden Smith, Jee W. 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_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833183"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.27"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.112"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3157733"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"e_1_3_3_46_2","article-title":"A high-performance sparse tensor algebra compiler in multi-level IR","author":"Tian Ruiqin","year":"2021","unstructured":"Ruiqin Tian, Luanzheng Guo, Jiajia Li, Bin Ren, and Gokcen Kestor. 2021. A high-performance sparse tensor algebra compiler in multi-level IR. arXiv preprint arXiv:2102.05187 (2021).","journal-title":"arXiv preprint arXiv:2102.05187"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.1445115"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.466439"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582047"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656426"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3566054"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3559009.3569685"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:45Z","timestamp":1750291545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3689342"],"URL":"https:\/\/doi.org\/10.1145\/3689342","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"2024-06-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}