{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:16Z","timestamp":1751662876336,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"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":[],"published-print":{"date-parts":[[2023,2,17]]},"DOI":"10.1145\/3579990.3580021","type":"proceedings-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T10:27:10Z","timestamp":1677061630000},"page":"28-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Code Synthesis for Sparse Tensor Format Conversion and Optimization"],"prefix":"10.1145","author":[{"given":"Tobi","family":"Popoola","sequence":"first","affiliation":[{"name":"Boise State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuowen","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"St. George","sequence":"additional","affiliation":[{"name":"Boise State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalyan","family":"Bhetwal","sequence":"additional","affiliation":[{"name":"Boise State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle Mills","family":"Strout","sequence":"additional","affiliation":[{"name":"University of Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary","family":"Hall","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Olschanowsky","sequence":"additional","affiliation":[{"name":"Boise State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371275"},{"volume-title":"Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag","author":"Aart J.","key":"e_1_3_2_1_2_1","unstructured":"Aart J. C. Bik and Harry A. G. Wijshoff. 1993. On Automatic Data Structure Selection and Code Generation for Sparse Computations. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag, Berlin, Heidelberg. 57\u201375. isbn:3540576592"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837666"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254123"},{"volume-title":"CHiLL: A Framework for Composing High-Level Loop Transformations","author":"Chen Chun","key":"e_1_3_2_1_5_1","unstructured":"Chun Chen, Jacqueline Chame, and Mary Hall. 2008. CHiLL: A Framework for Composing High-Level Loop Transformations. University of Southern California."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385963"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3461703"},{"volume-title":"The Omega Library Interface Guide","author":"Kelly Wayne","key":"e_1_3_2_1_11_1","unstructured":"Wayne Kelly, Vadim Maslov, William Pugh, Evan Rosser, Tatiana Shpeisman, and David Wonnacott. 1995. The Omega Library Interface Guide. University of Maryland at College Park."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314602"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00022"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3330366"},{"key":"e_1_3_2_1_16_1","volume-title":"Anand Venkat, Tomofumi Yuki, and Michelle Mills Strout.","author":"Mohammadi Mahdi Soltan","year":"2019","unstructured":"Mahdi Soltan Mohammadi, Kazem Cheshmi, Maryam Mehri Dehnavi, Anand Venkat, Tomofumi Yuki, and Michelle Mills Strout. 2019. Extending Index-Array Properties for Data Dependence Analysis. In Languages and Compilers for Parallel Computing, Mary Hall and Hari Sundar (Eds.). Springer International Publishing, Cham. 78\u201393. isbn:978-3-030-34627-0"},{"key":"e_1_3_2_1_17_1","volume-title":"Mahdi Soltan Mohammadi, Wei He, and Michelle Mills Strout.","author":"Nandy Payal","year":"2018","unstructured":"Payal Nandy, Mary W. Hall, Eddie C. Davis, Catherine Mills Olschanowsky, Mahdi Soltan Mohammadi, Wei He, and Michelle Mills Strout. 2018. Abstractions for Specifying Sparse Matrix Data Transformations."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC51774.2021.00275"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3554347"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the Eleventh International Workshop on Languages and Compilers for Parallel Computing","author":"Pugh William","year":"1998","unstructured":"William Pugh and Tatiana Shpeisman. 1998. SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations. In Proceedings of the Eleventh International Workshop on Languages and Compilers for Parallel Computing. Chapel Hill, North Carolina."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967943"},{"key":"e_1_3_2_1_22_1","unstructured":"Yousef Saad. 1994. SPARSKIT: a basic tool kit for sparse matrix computations."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236034"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_3"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Michelle Mills Strout Geri Georg and Catherine Olschanowsky. 2013. Set and relation manipulation for the Sparse Polyhedral Framework. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7760 LNCS (2013) 61\u201375. isbn:9783642376573 issn:03029743 https:\/\/doi.org\/10.1007\/978-3-642-37658-0_5 10.1007\/978-3-642-37658-0_5","DOI":"10.1007\/978-3-642-37658-0_5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2738003"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of Annual IEEE\/ACM International Symposium on Code Generation and Optimization (CGO \u201914)","author":"Venkat Anand","year":"2014","unstructured":"Anand Venkat, Manu Shantharam, Mary Hall, and Michelle Mills Strout. 2014. Non-affine Extensions to Polyhedral Code Generation. In Proceedings of Annual IEEE\/ACM International Symposium on Code Generation and Optimization (CGO \u201914)."},{"volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi","author":"Wang Endong","key":"e_1_3_2_1_29_1","unstructured":"Endong Wang, Qing Zhang, Bo Shen, Guangyong Zhang, Xiaowei Lu, Qing Wu, and Yajuan Wang. 2014. Intel math kernel library. In High-Performance Computing on the Intel\u00ae Xeon Phi. Springer, 167\u2013188."}],"event":{"name":"CGO '23: 21st ACM\/IEEE International Symposium on Code Generation and Optimization","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","SIGPLAN ACM Special Interest Group on Programming Languages","IEEE-CS Computer Society"],"location":"Montr\u00e9al QC Canada","acronym":"CGO '23"},"container-title":["Proceedings of the 21st ACM\/IEEE International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579990.3580021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579990.3580021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:19Z","timestamp":1750183699000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579990.3580021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":29,"alternative-id":["10.1145\/3579990.3580021","10.1145\/3579990"],"URL":"https:\/\/doi.org\/10.1145\/3579990.3580021","relation":{},"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"2023-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}