{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T22:37:46Z","timestamp":1789684666713,"version":"4.0.1"},"reference-count":93,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T00:00:00Z","timestamp":1707955200000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>\n            Performance in scientific and engineering applications such as computational physics, algebraic graph problems or Convolutional Neural Networks (CNN), is dominated by the manipulation of large sparse matrices\u2014matrices with a large number of zero elements. Specialized software using data formats for sparse matrices has been optimized for the main kernels of interest: SpMV and SpMSpM matrix multiplications, but due to the indirect memory accesses, the performance is still limited by the memory hierarchy of conventional computers. Recent work shows that specific hardware accelerators can reduce memory traffic and improve the execution time of sparse matrix multiplication, compared to the best software implementations. The performance of these sparse hardware accelerators depends on the choice of the sparse format,\n            <jats:italic>COO<\/jats:italic>\n            ,\n            <jats:italic>CSR<\/jats:italic>\n            , etc, the algorithm,\n            <jats:italic>inner-product<\/jats:italic>\n            ,\n            <jats:italic>outer-product<\/jats:italic>\n            ,\n            <jats:italic>Gustavson<\/jats:italic>\n            , and many hardware design choices. In this article, we propose a systematic survey which identifies the design choices of state-of-the-art accelerators for sparse matrix multiplication kernels. We introduce the necessary concepts and then present, compare, and classify the main sparse accelerators in the literature, using consistent notations. Finally, we propose a taxonomy for these accelerators to help future designers make the best choices depending on their objectives.\n          <\/jats:p>","DOI":"10.1145\/3640542","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T12:15:42Z","timestamp":1705493742000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Dedicated Hardware Accelerators for Processing of Sparse Matrices and Vectors: A Survey"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9842-5777","authenticated-orcid":false,"given":"Valentin","family":"Isaac\u2013Chassande","sequence":"first","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CEA, LIST, Grenoble, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2617-5007","authenticated-orcid":false,"given":"Adrian","family":"Evans","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CEA, LIST, Grenoble, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-8461","authenticated-orcid":false,"given":"Yves","family":"Durand","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CEA, LIST, Grenoble, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0348-5624","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Rousseau","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CNRS, Grenoble INP, TIMA, Saint-Martin-d'Heres, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods","unstructured":"Richard Barrett, Michael Berry, Tony F. Chan, James Demmel, June Donato, Jack Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk van der Vorst. 1994. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Society for Industrial."},{"key":"e_1_3_2_3_2","unstructured":"James Alfred Ang Brian W. Barrett Kyle Bruce Wheeler and Richard C. Murphy. 2010. Introducing the graph 500. Office of Scientific United States."},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/HPCA47549.2020.00029","volume-title":"Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)","author":"Asgari Bahar","year":"2020","unstructured":"Bahar Asgari, Ramyad Hadidi, Tushar Krishna, Hyesoon Kim, and Sudhakar Yalamanchili. 2020. ALRESCHA: A lightweight reconfigurable sparse-computation accelerator. In Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA). 249\u2013260."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.22323\/1.430.0335","volume-title":"Proceedings of the 39th International Symposium on Lattice Field Theory \u2014 PoS (LATTICE2022)","author":"Ayyar Venkitesh","year":"2023","unstructured":"Venkitesh Ayyar, Evan Weinberg, Richard C. Brower, M .A. Clark, and Mathias Wagner. 2023. Optimizing staggered multigrid for exascale performance. In Proceedings of the 39th International Symposium on Lattice Field Theory \u2014 PoS (LATTICE2022). 335."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Ariful Azad Georgios A. Pavlopoulos Christos A. Ouzounis Nikos C. Kyrpides and Aydin Bulu\u00e7. 2018. HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks. Nucleic Acids Research 46 6 (January 2018) e33--e33.","DOI":"10.1093\/nar\/gkx1313"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/PACT52795.2021.00016","volume-title":"Proceedings of the 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT)","author":"Baek Daehyeon","year":"2021","unstructured":"Daehyeon Baek, Soojin Hwang, Taekyung Heo, Daehoon Kim, and Jaehyuk Huh. 2021. InnerSP: A memory efficient sparse matrix multiplication accelerator with locality-aware inner product processing. In Proceedings of the 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT). 116\u2013128."},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/HPCA51647.2021.00062","volume-title":"Proceedings of the 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Balaji Vignesh","year":"2021","unstructured":"Vignesh Balaji, Neal Crago, Aamer Jaleel, and Brandon Lucia. 2021. P-OPT: Practical optimal cache replacement for graph analytics. In Proceedings of the 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). 668\u2013681."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3085572"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/PACT.2019.00056","volume-title":"Proceedings of the 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT)","author":"Barredo Adri\u00e1n","year":"2019","unstructured":"Adri\u00e1n Barredo, Jonathan C. Beard, and Miquel Moret\u00f3. 2019. POSTER: SPiDRE: Accelerating sparse memory access patterns. In Proceedings of the 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT). Institute of Electrical and Electronics Engineers, New York, NY, USA, 483\u2013484."},{"key":"e_1_3_2_12_2","unstructured":"Scott Beamer Krste Asanovi\u0107 and David Patterson. 2017. The GAP Benchmark Suite. (2017)."},{"key":"e_1_3_2_13_2","volume-title":"Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC\u201909)","author":"Bell Nathan","year":"2009","unstructured":"Nathan Bell and Michael Garland. 2009. Implementing sparse matrix-vector multiplication on throughput-oriented processors. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC\u201909). Association for Computing Machinery, New York, NY, USA, Article 18, 11 pages."},{"key":"e_1_3_2_14_2","volume-title":"Multigrid Solvers and Multilevel Optimization Strategies","author":"Brandt Achi","year":"2003","unstructured":"Achi Brandt and Dorit Ron. 2003. Multigrid Solvers and Multilevel Optimization Strategies. Springer US, Boston, MA."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_16_2","volume-title":"The GraphBLAS C API Specification","author":"Brock Benjamin","year":"2021","unstructured":"Benjamin Brock, Ayd\u0131n Bulu\u00e7, Timothy Mattson, Scott McMillan, and Jos\u00e9 Moreira. 2021. The GraphBLAS C API Specification. Technical Report."},{"key":"e_1_3_2_17_2","volume-title":"Graph Algorithms in the Language of Linear Algebra","unstructured":"Ayd\u0131n Bulu\u00e7, John Gilbert, and Viral B. Shah. 2011. 13. Implementing Sparse Matrices for Graph Algorithms. In Graph Algorithms in the Language of Linear Algebra. Society for Industrial, 287--313."},{"key":"e_1_3_2_18_2","first-page":"590","volume-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC\u201907)","author":"Chan Timothy M.","year":"2007","unstructured":"Timothy M. Chan. 2007. More algorithms for all-pairs shortest paths in weighted graphs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC\u201907). Association for Computing Machinery, New York, NY, USA, 590\u2013598."},{"key":"e_1_3_2_19_2","first-page":"123","article-title":"Format abstraction for sparse tensor algebra compilers","volume":"2","author":"Chou Stephen","year":"2018","unstructured":"Stephen Chou, Fredrik Kjolstad, and Saman Amarasinghe. 2018. Format abstraction for sparse tensor algebra compilers. Proceedings of the ACM on Programming Languages 2, OOPSLA, Article 123 (2018), 30 pages.","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"e_1_3_2_20_2","volume-title":"Vitis Sparse Library","author":"Corporation Xilinx","year":"2021","unstructured":"Xilinx Corporation. 2021. Vitis Sparse Library. Technical Report. Retrieved from https:\/\/xilinx.github.io\/Vitis_Libraries\/sparse\/2021.1\/index.html"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/3352460.3358276","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952)","author":"Dadu Vidushi","year":"2019","unstructured":"Vidushi Dadu, Jian Weng, Sihao Liu, and Tony Nowatzki. 2019. Towards general purpose acceleration by exploiting common data-dependence forms. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952). Association for Computing Machinery, New York, NY, USA, 924\u2013939."},{"key":"e_1_3_2_22_2","unstructured":"Steven Dalton Nathan Bell Luke Olson and Michael Garland. 2014. Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations. Retrieved from http:\/\/cusplibrary.github.io\/"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Mehmet Deveci Simon David Hammond Michael M. Wolf and Sivasankaran Rajamanickam. 2018. Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures: Algorithms and Experiments. Office of Scientific United States.","DOI":"10.2172\/1435688"},{"key":"e_1_3_2_24_2","unstructured":"Stijn Dongen. 2000. Graph Clustering by Flow Simulation. PhD Thesis. Center for Math and Computer Science."},{"key":"e_1_3_2_25_2","first-page":"54","volume-title":"Proceedings of the 2022 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA\u201922)","author":"Du Yixiao","year":"2022","unstructured":"Yixiao Du, Yuwei Hu, Zhongchun Zhou, and Zhiru Zhang. 2022. High-performance sparse linear algebra on hbm-equipped fpgas using HLS: A case study on SpMV. In Proceedings of the 2022 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA\u201922). Association for Computing Machinery, New York, NY, USA, 54\u201364."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/567806.567810"},{"key":"e_1_3_2_27_2","unstructured":"Jason Lowe-Power Abdul Mutaal Ahmad Ayaz Akram Mohammad Alian Rico Amslinger Matteo Andreozzi Adri\u00e0 Armejach Nils Asmussen Brad Beckmann Srikant Bharadwaj Gabe Black Gedare Bloom Bobby R. Bruce Daniel Rodrigues Carvalho Jeronimo Castrillon Lizhong Chen Nicolas Derumigny Stephan Diestelhorst Wendy Elsasser Carlos Escuin Marjan Fariborz Amin Farmahini-Farahani Pouya Fotouhi Ryan Gambord Jayneel Gandhi Dibakar Gope Thomas Grass Anthony Gutierrez Bagus Hanindhito Andreas Hansson Swapnil Haria Austin Harris Timothy Hayes Adrian Herrera Matthew Horsnell Syed Ali Raza Jafri Radhika Jagtap Hanhwi Jang Reiley Jeyapaul Timothy M. Jones Matthias Jung Subash Kannoth Hamidreza Khaleghzadeh Yuetsu Kodama Tushar Krishna Tommaso Marinelli Christian Menard Andrea Mondelli Miquel Moreto Tiago M\u00fcck Omar Naji Krishnendra Nathella Hoa Nguyen Nikos Nikoleris Lena E. Olson Marc Orr Binh Pham Pablo Prieto Trivikram Reddy Alec Roelke Mahyar Samani Andreas Sandberg Javier Setoain Boris Shingarov Matthew D. Sinclair Tuan Ta Rahul Thakur Giacomo Travaglini Michael Upton Nilay Vaish Ilias Vougioukas William Wang Zhengrong Wang Norbert Wehn Christian Weis David A. Wood Hongil Yoon and \u00c9der F. Zulian. 2020. The gem5 Simulator: Version 20.0+. arXiv."},{"key":"e_1_3_2_28_2","volume-title":"2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)","unstructured":"Vijay Janapa Reddi, Christine Cheng, David Kanter, Peter Mattson, Guenther Schmuelling, Carole-Jean Wu, Brian Anderson, Maximilien Breughe, Mark Charlebois, William Chou, Ramesh Chukka, Cody Coleman, Sam Davis, Pan Deng, Greg Diamos, Jared Duke, Dave Fick, J. Scott Gardner, Itay Hubara, Sachin Idgunji, Thomas B. Jablin, Jeff Jiao, Tom St. John, Pankaj Kanwar, David Lee, Jeffery Liao, Anton Lokhmotov, Francisco Massa, Peng Meng, Paulius Micikevicius, Colin Osborne, Gennady Pekhimenko, Arun Tejusve Raghunath Rajan, Dilip Sequeira, Ashish Sirasao, Fei Sun, Hanlin Tang, Michael Thomson, Frank Wei, Ephrem Wu, Lingjie Xu, Koichi Yamada, Bing Yu, George Yuan, Aaron Zhong, Peizhao Zhang, and Yuchen Zhou. 2020. MLPerf inference benchmark. In 2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA). 446--459."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01086544"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586114"},{"key":"e_1_3_2_31_2","first-page":"14","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201920)","author":"Gale Trevor","year":"2020","unstructured":"Trevor Gale, Matei Zaharia, Cliff Young, and Erich Elsen. 2020. Sparse GPU kernels for deep learning. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201920). IEEE, 14 pages."},{"issue":"12","key":"e_1_3_2_32_2","first-page":"244","article-title":"A systematic survey of general sparse matrix-matrix multiplication","volume":"55","author":"Gao Jianhua","year":"2023","unstructured":"Jianhua Gao, Weixing Ji, Fangli Chang, Shiyu Han, Bingxin Wei, Zeming Liu, and Yizhuo Wang. 2023. A systematic survey of general sparse matrix-matrix multiplication. ACM Computing Surveys 55, 12, Article 244 (2023), 36 pages.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3281714"},{"key":"e_1_3_2_34_2","unstructured":"John R. Gilbert Steve Reinhardt and Viral B. Shah. 2006. High-performance graph algorithms from parallel sparse matrices (PARA\u201906). Springer-Verlag Berlin."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_36_2","volume-title":"Tilings and Patterns","author":"Gr\u00fcnbaum Branko","year":"1987","unstructured":"Branko Gr\u00fcnbaum and Geoffrey C. Shephard. 1987. Tilings and Patterns. W. H. Freeman and Co., New York."},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/HPCA53966.2022.00069","volume-title":"Proceedings of the 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Gudaparthi Sumanth","year":"2022","unstructured":"Sumanth Gudaparthi, Sarabjeet Singh, Surya Narayanan, Rajeev Balasubramonian, and Visvesh Sathe. 2022. CANDLES: Channel-aware novel dataflow-microarchitecture co-design for low energy sparse neural network acceleration. In Proceedings of the 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). 876\u2013891."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001163"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36803-5_14"},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/3352460.3358275","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952)","author":"Hegde Kartik","year":"2019","unstructured":"Kartik Hegde, Hadi Asghari-Moghaddam, Michael Pellauer, Neal Crago, Aamer Jaleel, Edgar Solomonik, Joel Emer, and Christopher W. Fletcher. 2019. ExTensor: An accelerator for sparse tensor algebra. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952). Association for Computing Machinery, New York, NY, USA, 319\u2013333."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643582"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"e_1_3_2_44_2","unstructured":"Intel. 2003. Intel Math Kernel Library. Retrieved from https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/tools\/oneapi\/onemkl.html#gs.ylo2j7"},{"issue":"2","key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0010-4655(95)00031-A","article-title":"Order-N tight-binding molecular dynamics on parallel computers","volume":"88","author":"Itoh Satoshi","year":"1995","unstructured":"Satoshi Itoh, Pablo Ordej\u00f3n, and Richard M. Martin. 1995. Order-N tight-binding molecular dynamics on parallel computers. Computer Physics Communications 88, 2 (1995), 173\u2013185.","journal-title":"Computer Physics Communications"},{"key":"e_1_3_2_46_2","volume-title":"JEDEC Updates Groundbreaking High Bandwidth Memory (HBM) Standard","year":"2016","unstructured":"JESD235A 2016. JEDEC Updates Groundbreaking High Bandwidth Memory (HBM) Standard. Technical Report. JEDEC. Retrieved from https:\/\/www.jedec.org\/news\/pressreleases\/jedec-updates-groundbreaking-high-bandwidth-memory-hbm-standard"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner David Bader Ayd\u0131n Bulu\u00e7 John Gilbert Timothy Mattson and Henning Meyerhenke. 2015. Graphs Matrices and the GraphBLAS: Seven Good Reasons. Procedia Computer Science International Conference On Computational Science (ICCS'15) Vol. 51 2453--2462.","DOI":"10.1016\/j.procs.2015.05.353"},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","unstructured":"David R. Kincaid Thomas C. Oppe and David M. Young. 1989. ITPACKV 2D user's guide. Office of Scientific United States.","DOI":"10.2172\/7093021"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967948"},{"key":"e_1_3_2_50_2","first-page":"77","article-title":"The tensor algebra compiler","volume":"1","author":"Kjolstad Fredrik","year":"2017","unstructured":"Fredrik Kjolstad, Shoaib Kamil, Stephen Chou, David Lugato, and Saman Amarasinghe. 2017. The tensor algebra compiler. Proceedings of the ACM on Programming Languages 1, OOPSLA, Article 77 (2017), 29 pages.","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.01244"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/106973.106981"},{"key":"e_1_3_2_53_2","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford large network dataset collection. Retrieved from http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"e_1_3_2_54_2","first-page":"S540\u2013S564","article-title":"A new class of amg interpolation methods based on matrix-matrix multiplications","volume":"43","author":"Li Ruipeng","year":"2021","unstructured":"Ruipeng Li, Bj\u00f6rn Sj\u00f6green, and Ulrike Meier Yang. 2021. A new class of amg interpolation methods based on matrix-matrix multiplications. SIAM Journal on Scientific Computing 43, 5 (2021), S540\u2013S564.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"e_1_3_2_55_2","first-page":"469","volume-title":"Proceedings of the 2009 42nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Li Sheng","year":"2009","unstructured":"Sheng Li, Jung Ho Ahn, Richard D. Strong, Jay B. Brockman, Dean M. Tullsen, and Norman P. Jouppi. 2009. McPAT: An integrated power, area, and timing modeling framework for multicore and manycore architectures. In Proceedings of the 2009 42nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). Institute of Electrical and Electronics Engineers and Association for Computing Machinery, New York, NY, USA, 469\u2013480."},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","unstructured":"Shiqing Li Shuo Huai and Weichen Liu. 2023. An efficient gustavson-based sparse matrix.matrix multiplication Accelerator on Embedded FPGAs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 42 12 (December 2023) 4671--4680.","DOI":"10.1109\/TCAD.2023.3281719"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3281719"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.47"},{"key":"e_1_3_2_59_2","unstructured":"Thaha Mohammed and Rashid Mehmood. 2022. Performance enhancement strategies for sparse matrix-vector multiplication (SpMV) and iterative linear solvers. (2022)."},{"key":"e_1_3_2_60_2","first-page":"252","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 (ASPLOS 2023)","author":"Mart\u00ednez Francisco Mu\u00f1oz","year":"2023","unstructured":"Francisco Mu\u00f1oz Mart\u00ednez, Raveesh Garg, Michael Pellauer, Jos\u00e9 L. Abell\u00e1n, Manuel E. Acacio, and Tushar Krishna. 2023. Flexagon: A multi-dataflow sparse-sparse matrix multiplication accelerator for efficient DNN processing. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 (ASPLOS 2023). Association for Computing Machinery, New York, NY, USA, 252\u2013265."},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1145\/3352460.3358254","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952)","author":"Mukkara Anurag","year":"2019","unstructured":"Anurag Mukkara, Nathan Beckmann, and Daniel Sanchez. 2019. PHI: Architectural support for synchronization- and bandwidth-efficient commutative scatter updates. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952). Association for Computing Machinery, New York, NY, USA, 1009\u20131022."},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/IISWC53511.2021.00028","volume-title":"Proceedings of the 2021 IEEE International Symposium on Workload Characterization (IISWC)","author":"Mu\u00f1oz-Mart\u00ednez Francisco","year":"2021","unstructured":"Francisco Mu\u00f1oz-Mart\u00ednez, Jos\u00e9 L. Abell\u00e1n, Manuel E. Acacio, and Tushar Krishna. 2021. STONNE: Enabling cycle-level microarchitectural simulation for dnn inference accelerators. In Proceedings of the 2021 IEEE International Symposium on Workload Characterization (IISWC). 201\u2013213."},{"key":"e_1_3_2_63_2","volume-title":"Workshop Proceedings of the 47th International Conference on Parallel Processing (ICPP Workshops\u201918)","author":"Nagasaka Yusuke","year":"2018","unstructured":"Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, and Ayd\u0131n Bulu\u00e7. 2018. High-performance sparse matrix-matrix products on intel knl and multicore architectures. In Workshop Proceedings of the 47th International Conference on Parallel Processing (ICPP Workshops\u201918). Association for Computing Machinery, New York, NY, USA, Article 34, 10 pages."},{"key":"e_1_3_2_64_2","unstructured":"NVIDIA. 2014. cuSPARSE Library. Retrieved from https:\/\/developer.nvidia.com\/cusparse"},{"key":"e_1_3_2_65_2","first-page":"724","volume-title":"Proceedings of the 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA)","author":"Pal Subhankar","year":"2018","unstructured":"Subhankar Pal, Jonathan Beaumont, Dong-Hyeon Park, Aporva Amarnath, Siying Feng, Chaitali Chakrabarti, Hun-Seok Kim, David Blaauw, Trevor Mudge, and Ronald Dreslinski. 2018. OuterSPACE: An outer product based sparse matrix multiplication accelerator. In Proceedings of the 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA). Institute of Electrical and Electronics Engineers, New York, NY, USA, 724\u2013736."},{"key":"e_1_3_2_66_2","doi-asserted-by":"crossref","unstructured":"A. Parashar M. Rhu A. Mukkara A. Puglielli R. Venkatesan B. Khailany J. Emer S. W. Keckler and W. J. Dally. 2017. SCNN: An accelerator for compressed-sparse convolutional neural networks. In 2017 ACM\/IEEE 44th Annual International Symposium on Computer Architecture (ISCA) IEEE Computer Society Los Alamitos CA USA 27--40.","DOI":"10.1145\/3079856.3080254"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.008"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90005-9"},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-031-11623-0_10","volume-title":"Proceedings of the Parallel Computational Technologies","volume":"1618","author":"Ryabkov Oleg I.","year":"2022","unstructured":"Oleg I. Ryabkov. 2022. Implementation of the algebraic multigrid solver designed for graphics processing units based on the AMGCL framework. In Proceedings of the Parallel Computational Technologies. Leonid Sokolinsky and Mikhail Zymbler (Eds.), Vol. 1618, Springer International Publishing, Cham, 131\u2013142."},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.5555\/829576"},{"key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/3352460.3358330","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952)","author":"Sadi Fazle","year":"2019","unstructured":"Fazle Sadi, Joe Sweeney, Tze Meng Low, James C. Hoe, Larry Pileggi, and Franz Franchetti. 2019. Efficient SpMV operation for large and highly sparse matrices using scalable multi-way merge parallelization. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952). Association for Computing Machinery, New York, NY, USA, 347\u2013358."},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485963"},{"key":"e_1_3_2_73_2","doi-asserted-by":"crossref","unstructured":"Conrad Sanderson and Ryan Curtin. 2016. Armadillo: a template-based C++ library for linear algebra. Journal of Open Source Software 1 2 (2016) 26.","DOI":"10.21105\/joss.00026"},{"key":"e_1_3_2_74_2","doi-asserted-by":"crossref","unstructured":"P. Scheffler F. Zaruba F. Schuiki T. Hoefler and L. Benini. 2023. Sparse stream semantic registers: A lightweight ISA extension accelerating general sparse linear algebra. IEEE Transactions on Parallel and Distributed Systems 34 12 (December 2023) 3147--3161.","DOI":"10.1109\/TPDS.2023.3322029"},{"key":"e_1_3_2_75_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. Retrieved from http:\/\/frostt.io\/"},{"key":"e_1_3_2_76_2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/HPCA.2018.00052","volume-title":"Proceedings of the 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA)","author":"Song Linghao","year":"2018","unstructured":"Linghao Song, Youwei Zhuo, Xuehai Qian, Hai Li, and Yiran Chen. 2018. GraphR: Accelerating graph processing using ReRAM. In Proceedings of the 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA). 531\u2013543."},{"key":"e_1_3_2_77_2","first-page":"1","article-title":"The superstrider architecture: Integrating logic and memory towards non-von Neumann computing","author":"Srikanth Sriseshan","year":"2017","unstructured":"Sriseshan Srikanth, Thomas M. Conte, Erik P. DeBenedictis, and Jeanine Cook. 2017. The superstrider architecture: Integrating logic and memory towards non-von Neumann computing. In Proceedings of the 2017 IEEE International Conference on Rebooting Computing, ICRC 2017. 1\u20138.","journal-title":"Proceedings of the 2017 IEEE International Conference on Rebooting Computing, ICRC 2017."},{"key":"e_1_3_2_78_2","doi-asserted-by":"crossref","unstructured":"Sriseshan Srikanth Anirudh Jain Thomas M. Conte Erik P. Debenedictis and Jeanine Cook. 2021. SortCache: Intelligent cache management for accelerating sparse data workloads. 18 4 Article 56 (2021) 24 pages.","DOI":"10.1145\/3473332"},{"key":"e_1_3_2_79_2","doi-asserted-by":"crossref","unstructured":"Sriseshan Srikanth Anirudh Jain Joseph M. Lennon Thomas M. Conte Erik Debenedictis and Jeanine Cook. 2019. MetaStrider: Architectures for scalable memory-centric reduction of sparse data streams. ACM Trans. Archit. Code Optim. 16 4 (October 2019) 1--26.","DOI":"10.1145\/3355396"},{"key":"e_1_3_2_80_2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/MICRO50266.2020.00068","volume-title":"Proceedings of the 2020 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Srivastava Nitish","year":"2020","unstructured":"Nitish Srivastava, Hanchen Jin, Jie Liu, David Albonesi, and Zhiru Zhang. 2020. MatRaptor: A sparse-sparse matrix multiplication accelerator based on row-wise product. In Proceedings of the 2020 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). Institute of Electrical and Electronics Engineers, New York, NY, USA, 766\u2013780."},{"key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/HPCA47549.2020.00062","volume-title":"Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)","author":"Srivastava Nitish","year":"2020","unstructured":"Nitish Srivastava, Hanchen Jin, Shaden Smith, Hongbo Rong, David Albonesi, and Zhiru Zhang. 2020. Tensaurus: A versatile accelerator for mixed sparse-dense tensor computations. In Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA). 689\u2013702."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01766-7"},{"key":"e_1_3_2_83_2","volume-title":"Sparse Matrices","author":"Tewarson Reginald P.","year":"1973","unstructured":"Reginald P. Tewarson. 1973. Sparse Matrices. Academic press New York, State University of New York, Stony Brook, NY."},{"key":"e_1_3_2_84_2","doi-asserted-by":"crossref","unstructured":"Richard Vuduc James W. Demmel and Katherine A. Yelick. 2005. OSKI: A library of automatically tuned sparse matrix kernels. Journal of Physics: Conference Series 16 1 (January 2005) 521.","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362674"},{"key":"e_1_3_2_86_2","first-page":"1377","volume-title":"Proceedings of the 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Wu Yannan Nellie","year":"2022","unstructured":"Yannan Nellie Wu, Po-An Tsai, Angshuman Parashar, Vivienne Sze, and Joel S. Emer. 2022. Sparseloop: An analytical approach to sparse tensor accelerator modeling. In Proceedings of the 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO). Institute of Electrical and Electronics Engineers and Association for Computing Machinery, New York, NY, USA, 1377\u20131395."},{"key":"e_1_3_2_87_2","first-page":"570","volume-title":"Proceedings of the 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Xie Xinfeng","year":"2021","unstructured":"Xinfeng Xie, Zheng Liang, Peng Gu, Abanti Basak, Lei Deng, Ling Liang, Xing Hu, and Yuan Xie. 2021. SpaceA: Sparse matrix vector multiplication on processing-in-memory accelerator. In Proceedings of the 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). 570\u2013583."},{"key":"e_1_3_2_88_2","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-642-19328-6_38","volume-title":"Proceedings of the High Performance Computing for Computational Science \u2013 VECPAR 2010","author":"Yamazaki Ichitaro","year":"2011","unstructured":"Ichitaro Yamazaki and Xiaoye S. Li. 2011. On techniques to improve robustness and scalability of a parallel hybrid linear solver. In Proceedings of the High Performance Computing for Computational Science \u2013 VECPAR 2010. Jos\u00e9 M. Laginha M. Palma, Michel Dayd\u00e9, Osni Marques, and Jo\u00e3o Correia Lopes (Eds.), Springer, Berlin, 421\u2013434."},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2020.106848"},{"issue":"4","key":"e_1_3_2_90_2","first-page":"49","article-title":"ASA: Accelerating sparse accumulation in column-wise SpGEMM","volume":"19","author":"Zhang Chao","year":"2022","unstructured":"Chao Zhang, Maximilian Bremer, Cy Chan, John Shalf, and Xiaochen Guo. 2022. ASA: Accelerating sparse accumulation in column-wise SpGEMM. ACM Transactions on Architecture and Code Optimization 19, 4, Article 49 (2022), 24 pages.","journal-title":"ACM Transactions on Architecture and Code Optimization"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446702"},{"key":"e_1_3_2_92_2","first-page":"13","volume-title":"Proceedings of the 2015 48th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Zhang Guowei","year":"2015","unstructured":"Guowei Zhang, Webb Horn, and Daniel Sanchez. 2015. Exploiting commutativity to reduce the cost of updates to shared data in cache-coherent systems. In Proceedings of the 2015 48th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). Institute of Electrical and Electronics Engineers and Association for Computing Machinery, New York, NY, USA, 13\u201325."},{"key":"e_1_3_2_93_2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1145\/3352460.3358272","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952)","author":"Zhang Guowei","year":"2019","unstructured":"Guowei Zhang and Daniel Sanchez. 2019. Leveraging caches to accelerate hash tables and memoization. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201952). Association for Computing Machinery, New York, NY, USA, 440\u2013452."},{"key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/HPCA47549.2020.00030","volume-title":"Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)","author":"Zhang Zhekai","year":"2020","unstructured":"Zhekai Zhang, Hanrui Wang, Song Han, and William J. Dally. 2020. SpArch: Efficient architecture for sparse matrix multiplication. In Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE Computer Society, Los Alamitos, CA, USA, 261\u2013274."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640542","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3640542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:25Z","timestamp":1750287025000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,15]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3640542"],"URL":"https:\/\/doi.org\/10.1145\/3640542","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,15]]},"assertion":[{"value":"2023-05-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}