{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:10:36Z","timestamp":1767856236427,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"US Department of Energy","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545048","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Algorithms for Masked Sparse Matrix-Matrix Products"],"prefix":"10.1145","author":[{"given":"Sr\u0111an","family":"Milakovi\u0107","sequence":"first","affiliation":[{"name":"Rice University, United States of America"}]},{"given":"Oguz","family":"Selvitopi","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, United States of America"}]},{"given":"Israt","family":"Nisa","sequence":"additional","affiliation":[{"name":"AWS AI, United States of America"}]},{"given":"Zoran","family":"Budimli\u0107","sequence":"additional","affiliation":[{"name":"Rice University, United States of America"}]},{"given":"Aydin","family":"Buluc","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00029"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M104253X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976229.14"},{"key":"e_1_3_2_1_5_1","first-page":"v2","article-title":"HPCS scalable synthetic compact applications 2: graph analysis","volume":"2","author":"Bader A","year":"2006","unstructured":"David\u00a0A Bader, John Feo, John Gilbert, Jeremy Kepner, David Koester, Eugene Loh, Kamesh Madduri, Bill Mann, and Theresa Meuse. 2006. HPCS scalable synthetic compact applications 2: graph analysis. SSCA 2(2006), v2.","journal-title":"SSCA"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110838844"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/347185"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_1_12_1","volume-title":"Design of the GraphBLAS API for C. In International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 643\u2013652","author":"Bulu\u00e7 Aydin","year":"2017","unstructured":"Aydin Bulu\u00e7, Tim Mattson, Scott McMillan, Jos\u00e9 Moreira, and Carl Yang. 2017. Design of the GraphBLAS API for C. In International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 643\u2013652."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. 442\u2013446.","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Timothy\u00a0A. Davis. 2018. Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss. In 2018 IEEE High Performance extreme Computing Conference (HPEC). 1\u20136.","DOI":"10.1109\/HPEC.2018.8547538"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322125"},{"key":"e_1_3_2_1_17_1","unstructured":"Timothy\u00a0A Davis. 2022. Algorithm 10xx: SuiteSparse:GraphBLAS: parallel graph algorithms in the language of sparse linear algebra. (2022). draft manuscript."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2018.06.009"},{"key":"e_1_3_2_1_21_1","volume-title":"Benchmarking optimization software with performance profiles. Mathematical Programming 91, 2 (01","author":"Dolan D.","year":"2002","unstructured":"Elizabeth\u00a0D. Dolan and Jorge\u00a0J. Mor\u00e9. 2002. Benchmarking optimization software with performance profiles. Mathematical Programming 91, 2 (01 Jan 2002), 201\u2013213."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Philip\u00a0A Etter Kai Zhong Hsiang-Fu Yu Lexing Ying and Inderjit Dhillon. 2021. Accelerating Inference for Sparse Extreme Multi-Label Ranking Trees. arXiv preprint arXiv:2106.02697(2021).","DOI":"10.1145\/3485447.3511973"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_26_1","volume-title":"Accumulating Jacobians as chained sparse matrix products. Mathematical Programming 95, 3 (01","author":"Griewank Andreas","year":"2003","unstructured":"Andreas Griewank and Uwe Naumann. 2003. Accumulating Jacobians as chained sparse matrix products. Mathematical Programming 95, 3 (01 Mar 2003), 555\u2013571."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_1_28_1","unstructured":"Donald\u00a0E. Knuth. 1998. The Art of Computer Programming Volume 3: (2nd Ed.) Sorting and Searching. Addison Wesley Longman Publishing Co. Inc. USA."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00030"},{"key":"e_1_3_2_1_30_1","volume-title":"An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data. In IEEE 28th International Parallel and Distributed Processing Symposium. 370\u2013381","author":"Liu W.","unstructured":"W. Liu and B. Vinter. 2014. An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data. In IEEE 28th International Parallel and Distributed Processing Symposium. 370\u2013381."},{"key":"e_1_3_2_1_31_1","volume-title":"Triangle Counting with Cyclic Distributions. In 2020 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 1\u20138.","author":"Lumsdaine Andrew","year":"2020","unstructured":"Andrew Lumsdaine, Luke Dalessandro, Kevin Deweese, Jesun Firoz, and Scott McMillan. 2020. Triangle Counting with Cyclic Distributions. In 2020 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 1\u20138."},{"key":"e_1_3_2_1_32_1","first-page":"45","article-title":"Introducing the graph 500","volume":"19","author":"Murphy C","year":"2010","unstructured":"Richard\u00a0C Murphy, Kyle\u00a0B Wheeler, Brian\u00a0W Barrett, and James\u00a0A Ang. 2010. Introducing the graph 500. Cray Users Group (CUG) 19 (2010), 45\u201374.","journal-title":"Cray Users Group (CUG)"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102545"},{"key":"e_1_3_2_1_34_1","volume-title":"High-Performance and Memory-Saving Sparse General Matrix-Matrix Multiplication for NVIDIA Pascal GPU. In 46th International Conference on Parallel Processing (ICPP). 101\u2013110","author":"Nagasaka Yusuke","year":"2017","unstructured":"Yusuke Nagasaka, Akira Nukada, and Satoshi Matsuoka. 2017. High-Performance and Memory-Saving Sparse General Matrix-Matrix Multiplication for NVIDIA Pascal GPU. In 46th International Conference on Parallel Processing (ICPP). 101\u2013110."},{"key":"e_1_3_2_1_35_1","volume-title":"Parallel Efficient Sparse Matrix-Matrix Multiplication on Multicore Platforms","author":"Mostofa\u00a0Ali Md.","unstructured":"Md. Mostofa\u00a0Ali Patwary 2015. Parallel Efficient Sparse Matrix-Matrix Multiplication on Multicore Platforms. In High Performance Computing, Julian\u00a0M. Kunkeland Thomas Ludwig (Eds.). Springer International Publishing, Cham, 48\u201357."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.008"},{"key":"e_1_3_2_1_37_1","volume-title":"Optimizing High Performance Markov Clustering for Pre-Exascale Architectures. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). 116\u2013126","author":"Selvitopi Oguz","year":"2020","unstructured":"Oguz Selvitopi, Md\u00a0Taufique Hussain, Ariful Azad, and Ayd\u0131n Bulu\u00e7. 2020. Optimizing High Performance Markov Clustering for Pre-Exascale Architectures. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). 116\u2013126."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1404637.1404639"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091043"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225122"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466795"}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","location":"Bordeaux France","acronym":"ICPP '22"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:44Z","timestamp":1750186964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":41,"alternative-id":["10.1145\/3545008.3545048","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545048","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}