{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:05:56Z","timestamp":1765544756879,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"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":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400216","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"293-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Bandwidth Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking"],"prefix":"10.1145","author":[{"given":"Zhixiang","family":"Gu","sequence":"first","affiliation":[{"name":"Indiana University Bloomington &amp; #38; Facebook Inc., Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Moreira","sequence":"additional","affiliation":[{"name":"IBM Corporation, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Edelsohn","sequence":"additional","affiliation":[{"name":"IBM Corporation, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariful","family":"Azad","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M104253X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_2_1_3_1","volume-title":"HipMCL: A high-performance parallel implementation of the markov clustering algorithm for large-scale networks. Nucleic acids research","author":"Azad Ariful","year":"2018","unstructured":"Ariful Azad , Georgios A Pavlopoulos , Christos A Ouzounis , Nikos C Kyrpides , and Aydin Bulucc . HipMCL: A high-performance parallel implementation of the markov clustering algorithm for large-scale networks. Nucleic acids research , 2018 . Ariful Azad, Georgios A Pavlopoulos, Christos A Ouzounis, Nikos C Kyrpides, and Aydin Bulucc. HipMCL: A high-performance parallel implementation of the markov clustering algorithm for large-scale networks. Nucleic acids research, 2018."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486196"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1028807"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.112"},{"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.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_1_10_1","volume-title":"Optimizing sparse matrix--matrix multiplication for the GPU. ACM Transactions on Mathematical Software (TOMS), 41(4):25","author":"Dalton Steven","year":"2015","unstructured":"Steven Dalton , Luke Olson , and Nathan Bell . Optimizing sparse matrix--matrix multiplication for the GPU. ACM Transactions on Mathematical Software (TOMS), 41(4):25 , 2015 . Steven Dalton, Luke Olson, and Nathan Bell. Optimizing sparse matrix--matrix multiplication for the GPU. ACM Transactions on Mathematical Software (TOMS), 41(4):25, 2015."},{"key":"e_1_3_2_1_11_1","volume-title":"The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1","author":"Davis Timothy A","year":"2011","unstructured":"Timothy A Davis and Yifan Hu . The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1 , 2011 . Timothy A Davis and Yifan Hu. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.8"},{"key":"e_1_3_2_1_13_1","volume-title":"ACML","author":"Feng Xu","year":"2018","unstructured":"Xu Feng , Yuyang Xie , Mingye Song , Wenjian Yu , and Jie Tang . Fast randomized pca for sparse data . In ACML , 2018 . Xu Feng, Yuyang Xie, Mingye Song, Wenjian Yu, and Jie Tang. Fast randomized pca for sparse data. In ACML, 2018."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75755-9_32"},{"key":"e_1_3_2_1_16_1","volume-title":"Bandwidth-optimized parallel SpGEMM algorithms using propagation blocking. Master's thesis","author":"Gu Zhixiang","year":"2019","unstructured":"Zhixiang Gu . Bandwidth-optimized parallel SpGEMM algorithms using propagation blocking. Master's thesis , Indiana University , 2019 . Zhixiang Gu. Bandwidth-optimized parallel SpGEMM algorithms using propagation blocking. Master's thesis, Indiana University, 2019."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.79"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137866"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2401575"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-018-0604-8"},{"key":"e_1_3_2_1_22_1","volume-title":"McCalpin. Stream: Sustainable memory bandwidth in high performance computers. Technical report","author":"John","year":"1991","unstructured":"John D. McCalpin. Stream: Sustainable memory bandwidth in high performance computers. Technical report , University of Virginia , 1991 --2007. John D. McCalpin. Stream: Sustainable memory bandwidth in high performance computers. Technical report, University of Virginia, 1991--2007."},{"issue":"1","key":"e_1_3_2_1_23_1","first-page":"5","article-title":"Engineering radix sort","volume":"6","author":"McIlroy Peter M","year":"1993","unstructured":"Peter M McIlroy , Keith Bostic , and M Douglas McIlroy . Engineering radix sort . Computing systems , 6 ( 1 ): 5 -- 27 , 1993 . Peter M McIlroy, Keith Bostic, and M Douglas McIlroy. Engineering radix sort. Computing systems, 6(1):5--27, 1993.","journal-title":"Computing systems"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102545"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.19"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2906166"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00067"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20119-1_4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/982792.982828"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:34Z","timestamp":1750202014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":30,"alternative-id":["10.1145\/3350755.3400216","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400216","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}