{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:57:17Z","timestamp":1768031837335,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["955513"],"award-info":[{"award-number":["955513"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["101070141"],"award-info":[{"award-number":["101070141"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100019180","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SNSF","award":["209358"],"award-info":[{"award-number":["209358"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,2]]},"DOI":"10.1145\/3627535.3638496","type":"proceedings-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T14:22:41Z","timestamp":1708438961000},"page":"404-416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5975-4526","authenticated-orcid":false,"given":"Lukas","family":"Gianinazzi","sequence":"first","affiliation":[{"name":"Computer Science, ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4328-9751","authenticated-orcid":false,"given":"Alexandros Nikolaos","family":"Ziogas","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9204-0346","authenticated-orcid":false,"given":"Langwen","family":"Huang","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8779-4223","authenticated-orcid":false,"given":"Piotr","family":"Luczynski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6115-6779","authenticated-orcid":false,"given":"Saleh","family":"Ashkboosh","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5766-894X","authenticated-orcid":false,"given":"Florian","family":"Scheidl","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3555-767X","authenticated-orcid":false,"given":"Armon","family":"Carigiet","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3735-6160","authenticated-orcid":false,"given":"Chio","family":"Ge","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5060-3059","authenticated-orcid":false,"given":"Nabil","family":"Abubaker","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-7916","authenticated-orcid":false,"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3657-6568","authenticated-orcid":false,"given":"Tal","family":"Ben-Nun","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-9797","authenticated-orcid":false,"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.10.001"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Albert R. Jeong H. and Barab\u00e1si A. Diameter of the world-wide web. 130--131.","DOI":"10.1038\/43601"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106204"},{"key":"e_1_3_2_2_5_1","volume-title":"A primer on statistical distributions","author":"Balakrishnan N.","year":"2004","unstructured":"Balakrishnan, N., and Nevzorov, V. B. A primer on statistical distributions. John Wiley & Sons, 2004."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015144"},{"key":"e_1_3_2_2_7_1","volume-title":"A discrete truncated zipf distribution. Statistica Neerlandica (09","author":"Boamah-Addo K.","year":"2022","unstructured":"Boamah-Addo, K., Kozubowski, T., and Panorska, A. A discrete truncated zipf distribution. Statistica Neerlandica (09 2022)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503293"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.03.012"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2009.10.010"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926278"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1206"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9191-1"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060302"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.010"},{"key":"e_1_3_2_2_18_1","article-title":"The university of florida sparse matrix collection","volume":"38","author":"Davis T. A.","unstructured":"Davis, T. A., and Hu, Y. The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1 (dec 2011).","journal-title":"ACM Trans. Math. Softw."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639359"},{"key":"e_1_3_2_2_20_1","series-title":"Lecture Notes in Computer Science","first-page":"168","volume-title":"Approximation and Online Algorithms - 12th International Workshop, WAOA","author":"Eikel M.","year":"2014","unstructured":"Eikel, M., Scheideler, C., and Setzer, A. Minimum linear arrangement of series-parallel graphs. In Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wroc\u0142aw, Poland, September 11--12, 2014, Revised Selected Papers (2014), E. Bampis and O. Svensson, Eds., vol. 8952 of Lecture Notes in Computer Science, Springer, pp. 168--180."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1682"},{"key":"e_1_3_2_2_22_1","volume-title":"7th Scandinavian Workshop on Algorithm Theory","volume":"1851","author":"Feige U.","year":"2000","unstructured":"Feige, U. Coping with the np-hardness of the graph bandwidth problem. In Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5--7, 2000, Proceedings (2000), M. M. Halld\u00f6rsson, Ed., vol. 1851 of Lecture Notes in Computer Science, Springer, pp. 10--19."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480113"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"e_1_3_2_2_25_1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham R. L.","year":"1994","unstructured":"Graham, R. L., Knuth, D. E., and Patashnik, O. Concrete Mathematics: A Foundation for Computer Science, second ed. Addison-Wesley, Reading, MA, 1994."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207169808804734"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Harris C. R. Millman K. J. van der Walt S. J. Gommers R. Virtanen P. Cournapeau D. Wieser E. Taylor J. Berg S. Smith N. J. Kern R. Picus M. Hoyer S. van Kerkwijk M. H. Brett M. Haldane A. del R\u00edo J. F. Wiebe M. Peterson P. G\u00e9rard-Marchant P. Sheppard K. Reddy T. Weckesser W. Abbasi H. Gohlke C. and Oliphant T. E. Array programming with NumPy. Nature 585 7825 (Sept. 2020) 357--362.","DOI":"10.1038\/s41586-020-2649-2"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.22"},{"key":"e_1_3_2_2_29_1","series-title":"Lecture Notes in Computer Science","first-page":"174","volume-title":"Parallel Processing and Applied Mathematics - 10th International Conference, PPAM","author":"Kaya K.","year":"2013","unstructured":"Kaya, K., U\u00e7ar, B., and \u00c7ataly\u00fcrek, \u00dc. V. Analysis of partitioning models and metrics in parallel sparse matrix-vector multiplication. In Parallel Processing and Applied Mathematics - 10th International Conference, PPAM 2013, Warsaw, Poland, September 8--11, 2013, Revised Selected Papers, Part II (2013), R. Wyrzykowski, J. J. Dongarra, K. Karczewski, and J. Wasniewski, Eds., vol. 8385 of Lecture Notes in Computer Science, Springer, pp. 174--184."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.117"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.stamet.2015.04.002"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8621968"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00238-X"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of Workshop on Machine Learning Systems (LearningSys) in The Thirty-first Annual Conference on Neural Information Processing Systems (NIPS)","author":"Okuta R.","year":"2017","unstructured":"Okuta, R., Unno, Y., Nishino, D., Hido, S., and Loomis, C. Cupy: A numpy-compatible library for nvidia gpu calculations. In Proceedings of Workshop on Machine Learning Systems (LearningSys) in The Thirty-first Annual Conference on Neural Information Processing Systems (NIPS) (2017)."},{"key":"e_1_3_2_2_37_1","volume-title":"International Conference on High Performance Computing & Simulation (HPCS 2020)","author":"Page B. A.","year":"2021","unstructured":"Page, B. A., and Kogge, P. M. Scalability of hybrid spmv with hyper-graph partitioning and vertex delegation for communication avoidance. In International Conference on High Performance Computing & Simulation (HPCS 2020) (2021)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1093\/imamat\/10.3.373","article-title":"Computational Variants of the Lanczos Method for the Eigenproblem","volume":"10","unstructured":"PAIGE, C. C. Computational Variants of the Lanczos Method for the Eigenproblem. IMA Journal of Applied Mathematics 10, 3 (12 1972), 373--381.","journal-title":"IMA Journal of Applied Mathematics"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/314464.314625"},{"key":"e_1_3_2_2_41_1","first-page":"2","article-title":"New approximation techniques for some linear ordering problems","volume":"34","author":"Rao S.","year":"2004","unstructured":"Rao, S., and Richa, A. W. New approximation techniques for some linear ordering problems. SIAM J. Comput. 34, 2 (2004), 388--404.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.037"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90031-6"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/140993478"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3461472"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00074"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215041"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Virtanen P. Gommers R. Oliphant T. E. Haberland M. Reddy T. Cournapeau D. Burovski E. Peterson P. Weckesser W. Bright J. van der Walt S. J. Brett M. Wilson J. Millman K. J. Mayorov N. Nelson A. R. J. Jones E. Kern R. Larson E. Carey C. J. Polat \u0130. Feng Y. Moore E. W. VanderPlas J. Laxalde D. Perktold J. Cimrman R. Henriksen I. Quintero E. A. Harris C. R. Archibald A. M. Ribeiro A. H. Pedregosa F. van Mulbregt P. and SciPy 1.0 Contributors. SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17 (2020) 261--272.","DOI":"10.1038\/s41592-020-0772-5"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2618791"},{"key":"e_1_3_2_2_51_1","volume-title":"Human behavior and the principle of least effort: An introduction to human ecology","author":"Zipf G. K.","year":"1949","unstructured":"Zipf, G. K. Human behavior and the principle of least effort: An introduction to human ecology. Addison-Wesley, Cambridge, Massachusetts, 1949."}],"event":{"name":"PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","location":"Edinburgh United Kingdom","acronym":"PPoPP '24","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627535.3638496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:04Z","timestamp":1750287004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":51,"alternative-id":["10.1145\/3627535.3638496","10.1145\/3627535"],"URL":"https:\/\/doi.org\/10.1145\/3627535.3638496","relation":{},"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"2024-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}