{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:17:40Z","timestamp":1780366660685,"version":"3.54.1"},"reference-count":97,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>Sparse tensors arise in problems in science, engineering, machine learning, and data analytics. Programs that operate on such tensors can exploit sparsity to reduce storage requirements and computational time. Developing and maintaining sparse software by hand, however, is a complex and error-prone task. Therefore, we propose treating sparsity as a property of tensors, not a tedious implementation task, and letting a sparse compiler generate sparse code automatically from a sparsity-agnostic definition of the computation. This article discusses integrating this idea into MLIR.<\/jats:p>","DOI":"10.1145\/3544559","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T12:04:41Z","timestamp":1659960281000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Compiler Support for Sparse Tensor Computations in MLIR"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0333-7413","authenticated-orcid":false,"given":"Aart","family":"Bik","sequence":"first","affiliation":[{"name":"Google USA, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0748-1818","authenticated-orcid":false,"given":"Penporn","family":"Koanantakool","sequence":"additional","affiliation":[{"name":"Google USA, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4225-8734","authenticated-orcid":false,"given":"Tatiana","family":"Shpeisman","sequence":"additional","affiliation":[{"name":"Google USA, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4096-3325","authenticated-orcid":false,"given":"Nicolas","family":"Vasilache","sequence":"additional","affiliation":[{"name":"Google USA, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5772-5449","authenticated-orcid":false,"given":"Bixia","family":"Zheng","sequence":"additional","affiliation":[{"name":"Google USA, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2267-903X","authenticated-orcid":false,"given":"Fredrik","family":"Kjolstad","sequence":"additional","affiliation":[{"name":"Stanford University USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"265","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916)","author":"Abadi Mart\u00edn","year":"2016","unstructured":"Mart\u00edn Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et\u00a0al. 2016. TensorFlow: A system for Large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916). 265\u2013283."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053389000056"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/IPDPS.2016.86","volume-title":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201916)","author":"Anderson Michael J.","year":"2016","unstructured":"Michael J. Anderson, Narayanan Sundaram, Nadathur Satish, Md Mostofa Ali Patwary, Theodore L. Willke, and Pradeep Dubey. 2016. Graphpad: Optimized graph primitives for parallel and distributed platforms. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201916). IEEE, 313\u2013322."},{"key":"e_1_3_2_5_2","volume-title":"Data-parallel Language for Correct and Efficient Sparse Matrix Codes","author":"Arnold Gilad","year":"2011","unstructured":"Gilad Arnold. 2011. Data-parallel Language for Correct and Efficient Sparse Matrix Codes. University of California, Berkeley."},{"key":"e_1_3_2_6_2","article-title":"TIRAMISU: A polyhedral compiler for dense and sparse deep learning","author":"Baghdadi Riyadh","year":"2020","unstructured":"Riyadh Baghdadi, Abdelkader Nadir Debbagh, Kamel Abdous, Fatima Zohra Benhamida, Alex Renda, Jonathan Elliott Frankle, Michael Carbin, and Saman Amarasinghe. 2020. TIRAMISU: A polyhedral compiler for dense and sparse deep learning. arXiv preprint arXiv:2005.04091 (2020).","journal-title":"arXiv preprint arXiv:2005.04091"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1986-6_8"},{"key":"e_1_3_2_8_2","volume-title":"Compiler Support for Sparse Matrix Computations","author":"Bik Aart J. C.","year":"1996","unstructured":"Aart J. C. Bik. 1996. Compiler Support for Sparse Matrix Computations. Ph.D. Dissertation. Department of Computer Science, Leiden University. ISBN 90-9009442-3."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/290200.287636"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1141"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.485501"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979529595X"},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Ronald Boisvert Roldan Pozo and K. Remington. 1996. The Matrix Market Exchange Formats: Initial Design. NIST Interagency\/Internal Report (NISTIR) National Institute of Standards and Technology Gaithersburg MD.","DOI":"10.6028\/NIST.IR.5935"},{"key":"e_1_3_2_14_2","unstructured":"James Bradbury Roy Frostig Peter Hawkins Matthew James Johnson Chris Leary Dougal Maclaurin George Necula Adam Paszke Jake VanderPlas Skye Wanderman-Milne and Qiao Zhang. 2018. JAX: Composable transformations of Python+NumPy programs. http:\/\/github.com\/google\/jax."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584053"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126936"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385963"},{"key":"e_1_3_2_21_2","volume-title":"Lecture Notes in Computer Science, No. 165","author":"Coleman Thomas F.","year":"1984","unstructured":"Thomas F. Coleman. 1984. Large sparse numerical optimization. In Lecture Notes in Computer Science, No. 165, G. Goos and J. Hartmanis (Eds.). Springer-Verlag, Berlin."},{"key":"e_1_3_2_22_2","unstructured":"NVIDIA Corporation. 2021. cuSPARSELt: A High-Performance CUDA Library for Sparse Matrix-Matrix Multiplication. https:\/\/docs.nvidia.com\/cuda\/cusparselt\/index.html."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/8.3.344"},{"key":"e_1_3_2_24_2","unstructured":"Steven Dalton Nathan Bell Luke Olson and Michael Garland. 2014. Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations. http:\/\/cusplibrary.github.io\/.Version 0.5.0."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3322125"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1977.10514"},{"key":"e_1_3_2_28_2","first-page":"1","volume-title":"Sparsity and Its Applications","author":"Duff Iain S.","year":"1985","unstructured":"Iain S. Duff. 1985. Data structures, algorithms and software for sparse matrices. In Sparsity and Its Applications, David J. Evans (Ed.). Cambridge University Press, 1\u201329."},{"key":"e_1_3_2_29_2","volume-title":"Direct Methods for Sparse Matrices","author":"Duff Iain S.","year":"1990","unstructured":"Iain S. Duff, A. M. Erisman, and J. K. Reid. 1990. Direct Methods for Sparse Matrices. Oxford Science Publications, Oxford."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"e_1_3_2_31_2","first-page":"49","volume-title":"Software for Numerical Mathematics","author":"Evans D. J.","year":"1974","unstructured":"D. J. Evans. 1974. Iterative sparse matrix algorithms. In Software for Numerical Mathematics, D. J. Evans (Ed.). Academic Press, New York, NY, 49\u201383."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00021"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.5555\/578296"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_35_2","article-title":"Eigen","author":"Guennebaud Ga\u00ebl","year":"2010","unstructured":"Ga\u00ebl Guennebaud, Benoit Jacob, et\u00a0al. 2010. Eigen. http:\/\/eigen.tuxfamily.org.","journal-title":"http:\/\/eigen.tuxfamily.org."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-8675-3_4"},{"key":"e_1_3_2_37_2","article-title":"Graph Theory, chs. 2, 13","author":"Harary F.","year":"1969","unstructured":"F. Harary. 1969. Graph Theory, chs. 2, 13. Addison Wesley, Reading.","journal-title":"Addison Wesley, Reading"},{"key":"e_1_3_2_38_2","first-page":"139","volume-title":"Large Sparse Sets of Linear Equations","author":"Harary Frank","year":"1971","unstructured":"Frank Harary. 1971. Sparse matrices and graph theory. In Large Sparse Sets of Linear Equations, J. K. Reid (Ed.). Academic Press, 139\u2013150."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.83"},{"key":"e_1_3_2_40_2","article-title":"ALTO: Adaptive linearized storage of sparse tensors","volume":"2102","author":"Helal Ahmed E.","year":"2021","unstructured":"Ahmed E. Helal, Jan Laukemann, Fabio Checconi, Jesmin Jahan Tithi, Teresa M. Ranadive, Fabrizio Petrini, and Jeewhan Choi. 2021. ALTO: Adaptive linearized storage of sparse tensors. CoRR abs\/2102.10245 (2021). arXiv:2102.10245https:\/\/arxiv.org\/abs\/2102.10245.","journal-title":"CoRR"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485505"},{"issue":"6","key":"e_1_3_2_42_2","first-page":"1","article-title":"Taichi: A language for high-performance computation on spatially sparse data structures","volume":"38","author":"Hu Yuanming","year":"2019","unstructured":"Yuanming Hu, Tzu-Mao Li, Luke Anderson, Jonathan Ragan-Kelley, and Fr\u00e9do Durand. 2019. Taichi: A language for high-performance computation on spatially sparse data structures. ACM Transactions on Graphics (TOG) 38, 6 (2019), 1\u201316.","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/10.1007\/s00778-016-0427-4"},{"key":"e_1_3_2_45_2","volume-title":"Workshop on Profile and Feedback-directed Compilation","author":"Im Eun Jin","year":"1998","unstructured":"Eun Jin Im and Katherine Yelick. 1998. Model-based memory hierarchy optimizations for sparse matrices. In Workshop on Profile and Feedback-directed Compilation."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.4798940"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.05.353"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356009"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28928307"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","unstructured":"Fredrik Kjolstad et\u00a0al. 2017. TACO: The Tensor Algebra Compiler. Open-source project available at http:\/\/tensor-compiler.org\/.","DOI":"10.1145\/3133901"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661185"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0002751"},{"key":"e_1_3_2_55_2","volume-title":"Performance of PETSc GPU Implementation with Sparse Matrix Storage Schemes","author":"Kumbhar Pramod","year":"2011","unstructured":"Pramod Kumbhar. 2011. Performance of PETSc GPU Implementation with Sparse Matrix Storage Schemes. Ph.D. Dissertation. Master\u2019s thesis, The University of Edinburgh (Aug. 2011)."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_2_57_2","article-title":"MLIR: A compiler infrastructure for the end of Moore\u2019s law","volume":"2002","author":"Lattner Chris","year":"2020","unstructured":"Chris Lattner, Jacques A. Pienaar, Mehdi Amini, Uday Bondhugula, River Riddle, Albert Cohen, Tatiana Shpeisman, Andy Davis, Nicolas Vasilache, and Oleksandr Zinenko. 2020. MLIR: A compiler infrastructure for the end of Moore\u2019s law. CoRR abs\/2002.11054 (2020). arxiv:2002.11054. https:\/\/arxiv.org\/abs\/2002.11054.","journal-title":"CoRR"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00022"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3330366"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/6497.6499"},{"key":"e_1_3_2_61_2","first-page":"313","volume-title":"Numerical Solutions of Partial Differential Equations","author":"Mann Ken J.","year":"1982","unstructured":"Ken J. Mann. 1982. Inversion of large sparse matrices: Direct methods. In Numerical Solutions of Partial Differential Equations, J. Noye (Ed.). North-Holland Publishing Company, Amsterdam, 313\u2013366."},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/335231.335240"},{"key":"e_1_3_2_63_2","article-title":"COMET: A domain-specific compilation of high-performance computational chemistry","author":"Mutlu Erdal","year":"2021","unstructured":"Erdal Mutlu, Ruiqin Tian, Bin Ren, Sriram Krishnamoorthy, Roberto Gioiosa, Jacques Pienaar, and Gokcen Kestor. 2021. COMET: A domain-specific compilation of high-performance computational chemistry. arXiv preprint arXiv:2102.06827 (2021).","journal-title":"arXiv preprint arXiv:2102.06827"},{"key":"e_1_3_2_64_2","volume-title":"GPU Technology Conference","author":"Naumov Maxim","year":"2010","unstructured":"Maxim Naumov, L. Chien, Philippe Vandermersch, and Ujval Kapasi. 2010. Cusparse library. In GPU Technology Conference."},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2018.00013"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1002\/cnm.1630030106"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1080\/00268971003662896"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924060"},{"key":"e_1_3_2_69_2","volume-title":"Sparse Matrix Technology","author":"Pissanetsky Sergio","year":"1984","unstructured":"Sergio Pissanetsky. 1984. Sparse Matrix Technology. Academic Press, London."},{"key":"e_1_3_2_70_2","first-page":"213","volume-title":"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 International Workshop on Languages and Compilers for Parallel Computing. Springer, 213\u2013229."},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.63"},{"key":"e_1_3_2_72_2","first-page":"29","volume-title":"Software for Numerical Mathematics","author":"Reid J. K.","year":"1974","unstructured":"J. K. Reid. 1974. Direct methods for sparse matrices. In Software for Numerical Mathematics, D. J. Evans (Ed.). Academic Press, New York, NY, 29\u201347."},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5018-0"},{"key":"e_1_3_2_74_2","volume-title":"SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations","author":"Saad Youcef","year":"1990","unstructured":"Youcef Saad. 1990. SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations. CSRD\/RIACS."},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1963.291477"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428226"},{"key":"e_1_3_2_78_2","unstructured":"Gus Henry Smith Aart J. C. Bik Penporn Koanantakool and Phitchaya Mangpo Phothilimthana. 2022. ML-driven Auto-Configurator for Sparse Tensor Kernels in MLIR. Unpublished Manuscript."},{"key":"e_1_3_2_79_2","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_2_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833183"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833183"},{"key":"e_1_3_2_82_2","article-title":"Sparse tensor algebra as a parallel programming model","author":"Solomonik Edgar","year":"2015","unstructured":"Edgar Solomonik and Torsten Hoefler. 2015. Sparse tensor algebra as a parallel programming model. arXiv preprint arXiv:1512.00066 (2015).","journal-title":"arXiv preprint arXiv:1512.00066"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.112"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"e_1_3_2_85_2","volume-title":"An Investigation of Sparse Tensor Formats for Tensor Libraries","author":"Tew Parker Allen","year":"2016","unstructured":"Parker Allen Tew. 2016. An Investigation of Sparse Tensor Formats for Tensor Libraries. M.Eng. Thesis. Massachusetts Institute of Technology, Cambridge, MA. http:\/\/groups.csail.mit.edu\/commit\/papers\/2016\/parker-thesis.pdf."},{"key":"e_1_3_2_86_2","volume-title":"Sparse Matrices","author":"Tewarson Reginal P.","year":"1973","unstructured":"Reginal P. Tewarson. 1973. Sparse Matrices. Academic Press, New York, NY."},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1109\/LLVMHPC54804.2021.00009"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.6011"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.629489"},{"key":"e_1_3_2_90_2","article-title":"Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions","volume":"1802","author":"Vasilache Nicolas","year":"2018","unstructured":"Nicolas Vasilache, Oleksandr Zinenko, Theodoros Theodoridis, Priya Goyal, Zachary DeVito, William S. Moses, Sven Verdoolaege, Andrew Adams, and Albert Cohen. 2018. Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions. CoRR abs\/1802.04730 (2018). arxiv:1802.04730. http:\/\/arxiv.org\/abs\/1802.04730.","journal-title":"CoRR"},{"key":"e_1_3_2_91_2","volume-title":"An Analysis of Sparse Matrix Storage Schemes","author":"Veldhorst M.","year":"1982","unstructured":"M. Veldhorst. 1982. An Analysis of Sparse Matrix Storage Schemes. Ph.D. Dissertation. Mathematisch Centrum, Amsterdam."},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2738003"},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-319-06486-4_7","volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122","author":"Wang Endong","year":"2014","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\u2122. Springer, 167\u2013188."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3330354"},{"key":"e_1_3_2_96_2","article-title":"GraphBLAST: A high-performance linear algebra-based graph framework on the GPU","author":"Yang Carl","year":"2019","unstructured":"Carl Yang, Aydin Buluc, and John D. Owens. 2019. GraphBLAST: A high-performance linear algebra-based graph framework on the GPU. arXiv preprint arXiv:1908.01407 (2019).","journal-title":"arXiv preprint arXiv:1908.01407"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178495"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1116-6"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3544559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:21Z","timestamp":1750178781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":97,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3544559"],"URL":"https:\/\/doi.org\/10.1145\/3544559","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"2022-02-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}