{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:52:38Z","timestamp":1777675958145,"version":"3.51.4"},"reference-count":110,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.sagepub.com\/licence-information-for-chorus"}],"funder":[{"name":"Exascale Computing Project","award":["17-SC-20-SC"],"award-info":[{"award-number":["17-SC-20-SC"]}]},{"DOI":"10.13039\/100006228","name":"Oak Ridge National Laboratory","doi-asserted-by":"crossref","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100006228","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"crossref","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100017223","name":"National Energy Research Scientific Computing Center","doi-asserted-by":"crossref","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100017223","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000993","name":"Battelle Memorial Institute","doi-asserted-by":"crossref","award":["DE-AC06-76RL01830"],"award-info":[{"award-number":["DE-AC06-76RL01830"]}],"id":[{"id":"10.13039\/100000993","id-type":"DOI","asserted-by":"crossref"}]},{"name":"U.S. Department of Energy\u2019s National Nuclear Security Administration","award":["DE-NA-0003525"],"award-info":[{"award-number":["DE-NA-0003525"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2021,11]]},"abstract":"<jats:p>Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.<\/jats:p>","DOI":"10.1177\/10943420211029299","type":"journal-article","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:56:09Z","timestamp":1633049769000},"page":"553-571","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":14,"title":["EXAGRAPH: Graph and combinatorial methods for enabling exascale applications"],"prefix":"10.1177","volume":"35","author":[{"given":"Seher","family":"Acer","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariful","family":"Azad","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik G","family":"Boman","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayd\u0131n","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen D.","family":"Devine","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SM","family":"Ferdous","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5761-1027","authenticated-orcid":false,"given":"Nitin","family":"Gawande","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"},{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2323-4753","authenticated-orcid":false,"given":"Mahantesh","family":"Halappanavar","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"},{"name":"Washington State University, Pullman, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananth","family":"Kalyanaraman","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"},{"name":"Washington State University, Pullman, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arif","family":"Khan","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Minutoli","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivasankaran","family":"Rajamanickam","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oguz","family":"Selvitopi","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4297-3057","authenticated-orcid":false,"given":"Nathan R","family":"Tallent","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Tumeo","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"bibr1-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916302"},{"key":"bibr2-10943420211029299","doi-asserted-by":"crossref","unstructured":"Acer S, Boman EG, Rajamanickam S (2020) SPHYNX: Spectral partitioning for hybrid and axelerator-enabled systems. In: 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), New Orleans, LA, USA, 18-22 May 2020, pp. 440\u2013449.","DOI":"10.1109\/IPDPSW50202.2020.00082"},{"key":"bibr3-10943420211029299","volume-title":"Parallel Computing","author":"Acer S","year":"2021"},{"key":"bibr4-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2019.0056"},{"key":"bibr5-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.09.013"},{"key":"bibr6-10943420211029299","doi-asserted-by":"crossref","unstructured":"Al-Herz A, Pothen A (2020) A parallel 2\/3-approximation algorithm for vertex-weighted matching. In: Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, pp. 12\u201321.","DOI":"10.1137\/1.9781611976229.2"},{"key":"bibr7-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"bibr8-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"bibr9-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.103"},{"key":"bibr10-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00012"},{"key":"bibr11-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkx1313"},{"key":"bibr12-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/18M1189348"},{"key":"bibr13-10943420211029299","doi-asserted-by":"crossref","unstructured":"Barik R, Minutoli M, Halappanavar M, et al. (2020) Vertex reordering for real-world graphs and applications: an empirical evaluation. In: 2020 IEEE International Symposium on Workload Characterization, Beijing, China, 27-30 October 2020.","DOI":"10.1109\/IISWC50251.2020.00031"},{"key":"bibr14-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"bibr15-10943420211029299","doi-asserted-by":"crossref","unstructured":"Bodenheimer T, Halappanavar M, Jefferys S, et al. (2020) Fastpg: fast clustering of millions of single cells. bioRxiv.","DOI":"10.1101\/2020.06.19.159749"},{"key":"bibr16-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IA351965.2020.00013"},{"key":"bibr17-10943420211029299","volume-title":"Zoltan 3.0: Parallel Partitioning, Load Balancing, and Data-Management Services; User\u2019s Guide","author":"Boman E","year":"2007"},{"key":"bibr18-10943420211029299","volume-title":"Zoltan2: Next-Generation Combinatorial Toolkit","author":"Boman EG","year":"2012"},{"issue":"2","key":"bibr19-10943420211029299","first-page":"129","volume":"20","author":"Boman EG","year":"2012","journal-title":"sciprog"},{"key":"bibr20-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.08.002"},{"key":"bibr21-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3176"},{"key":"bibr22-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"bibr23-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"bibr24-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.117"},{"key":"bibr25-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.111"},{"key":"bibr26-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.88"},{"key":"bibr27-10943420211029299","unstructured":"Cheng X, Gebremedhin A, Patwary M, et al. (2020a) Colpack: a graph coloring library for derivative matrix computation and beyond. www.github.com\/CSCsw\/ColPack."},{"key":"bibr28-10943420211029299","doi-asserted-by":"crossref","unstructured":"Cheng X, Maji HK, Pothen A (2020b) Graphs with tunable chromatic numbers for parallel coloring. In: Proceedings of the SIAM Workshop on Combinatorial Scientific Computing pp. 11\u201320.","DOI":"10.1137\/1.9781611976229.6"},{"key":"bibr29-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"bibr30-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"bibr31-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895291765"},{"key":"bibr32-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.54"},{"key":"bibr33-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2412545"},{"key":"bibr34-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.8"},{"key":"bibr35-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2018.06.009"},{"key":"bibr36-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2900043"},{"key":"bibr37-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140029"},{"key":"bibr38-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"bibr39-10943420211029299","first-page":"938","volume":"15","author":"Donath W","year":"1972","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"bibr40-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897317661"},{"key":"bibr41-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198508380.001.0001"},{"key":"bibr42-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.07.003"},{"key":"bibr43-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.7.1575"},{"key":"bibr44-10943420211029299","doi-asserted-by":"crossref","unstructured":"Ferdous S, Pothen A, Khan A (2018) New approximation algorithms for minimum weighted edge cover. In: Proceedings of SIAM Workshop on Combinatorial Scientific Computing, pp. 97\u2013108.","DOI":"10.1137\/1.9781611975215.10"},{"key":"bibr45-10943420211029299","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"bibr46-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"bibr47-10943420211029299","doi-asserted-by":"crossref","unstructured":"Fox JS, Rajamanickam S (2020) How robust are graph neural networks to structural noise? In: The First International Workshop on Deep Learning on Graphs: Methodologies and Applications (DLGMA\u201920).","DOI":"10.2172\/1592845"},{"key":"bibr48-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2"},{"key":"bibr49-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"bibr50-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"bibr51-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547534"},{"key":"bibr52-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00098"},{"key":"bibr53-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916299"},{"key":"bibr54-10943420211029299","doi-asserted-by":"crossref","unstructured":"Gilbert MS, Acer S, Boman EG, et al. (2021) Performance-portable graph coarsening for efficient multilevel graph analysis. In: 2021 Proc. of IEEE International Parallel and Distributed Processing Symposium (IPDPS), Portland, OR, USA, 17-21 May 2021.","DOI":"10.1109\/IPDPS49936.2021.00030"},{"key":"bibr55-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761"},{"key":"bibr56-10943420211029299","doi-asserted-by":"crossref","unstructured":"Gu Z, Moreira J, Edelsohn D, et al. (2020) Bandwidth-optimized parallel algorithms for sparse matrix-matrix multiplication using propagation blocking. In: Symposium on Parallelism in Algorithms and Architectures (SPAA).","DOI":"10.1145\/3350755.3400216"},{"key":"bibr57-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091047"},{"key":"bibr58-10943420211029299","doi-asserted-by":"publisher","DOI":"10.2172\/10106339"},{"key":"bibr59-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"bibr60-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089021"},{"key":"bibr61-10943420211029299","doi-asserted-by":"crossref","unstructured":"Huang G, Dai G, Wang Y, et al. (2020) GE-SpMM: general-purpose sparse matrix-matrix multiplication on GPUs for graph neural networks. arXiv preprint arXiv:2007.03179.","DOI":"10.1109\/SC41405.2020.00076"},{"key":"bibr62-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500376193"},{"key":"bibr63-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"key":"bibr64-10943420211029299","volume-title":"Parmetis: Parallel graph partitioning and sparse matrix ordering library","author":"Karypis G","year":"1997"},{"key":"bibr65-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"bibr66-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"bibr67-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"bibr68-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00062"},{"key":"bibr69-10943420211029299","doi-asserted-by":"crossref","unstructured":"Khan A, Pothen A, Ferdous S (2018b) Parallel algorithms through approximation: b-edge cover. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, pp. 22\u201333.","DOI":"10.1109\/IPDPS.2018.00013"},{"key":"bibr70-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500366124"},{"key":"bibr71-10943420211029299","first-page":"34","volume-title":"SC\u201998: Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing","author":"Li XS","year":"1998"},{"key":"bibr72-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/779359.779361"},{"key":"bibr73-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"bibr74-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2620142"},{"key":"bibr75-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/2483852.2483871"},{"key":"bibr76-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2019.8890991"},{"key":"bibr77-10943420211029299","doi-asserted-by":"crossref","unstructured":"Minutoli M, Drocco M, Halappanavar M, et al. (2020a) cuRipples: influence maximization on multi-GPU systems. In: Proceedings of the International Conference on Supercomputing 2020 (ICS20).","DOI":"10.1145\/3392717.3392750"},{"key":"bibr78-10943420211029299","doi-asserted-by":"crossref","unstructured":"Minutoli M, Sambaturu P, Halappanavar M, et al. (2020b) PREEMPT: scalable epidemic interventions using submodular optimization on multi-GPU system. In: To appear in The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC20), Atlanta, GA, USA, 9-19 November 2020.","DOI":"10.1109\/SC41405.2020.00059"},{"key":"bibr79-10943420211029299","doi-asserted-by":"crossref","unstructured":"Nagasaka Y, Nukada A, Matsuoka S (2017) High-performance and memory-saving sparse general matrix-matrix multiplication for nvidia pascal gpu. In: 6th International Conference on Parallel Processing (ICPP), Bristol, UK, 14-17 August 2017, pp. 101\u2013110.","DOI":"10.1109\/ICPP.2017.19"},{"key":"bibr80-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102545"},{"key":"bibr81-10943420211029299","unstructured":"Naumov M, Moon T (2016) Parallel spectral graph partitioning. NVIDIA Tech. Rep. NVR-2016-001. NVIDIA."},{"key":"bibr82-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"bibr83-10943420211029299","unstructured":"NVIDIA (2020) Nvidia rapids cugraph. https:\/\/github.com\/rapidsai\/cugraph."},{"key":"bibr84-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/1003021"},{"key":"bibr85-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"bibr86-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492919000035"},{"key":"bibr87-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11352"},{"key":"bibr88-10943420211029299","doi-asserted-by":"publisher","DOI":"10.2172\/1482870"},{"key":"bibr89-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"bibr90-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/0205021"},{"key":"bibr91-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/2930660"},{"key":"bibr92-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.29"},{"key":"bibr93-10943420211029299","unstructured":"Sambaturu P, Adhikari B, Prakash BA, et al. (2020) Designing effective and practical interventions to contain epidemics. In: Proc. AAMAS."},{"key":"bibr94-10943420211029299","doi-asserted-by":"crossref","unstructured":"Selvitopi O, Ekanayake S, Guidi G, et al. (2020a) Distributed many-to-many protein sequence alignment using sparse matrices. In: Proceedings of the 2020 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC\u201920.","DOI":"10.1109\/SC41405.2020.00079"},{"key":"bibr95-10943420211029299","doi-asserted-by":"crossref","unstructured":"Selvitopi O, Hussain MT, Azad A, et al. (2020b) Optimizing high performance Markov clustering for pre-exascale architectures. In: International Parallel and Distributed Processing Symposium IPDPS.","DOI":"10.1109\/IPDPS47924.2020.00022"},{"key":"bibr96-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"bibr97-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"bibr98-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3988"},{"key":"bibr99-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"bibr100-10943420211029299","doi-asserted-by":"crossref","unstructured":"Tang Y-H, Selvitopi O, Popovici D, et al. (2020) A high-throughput solver for marginalized graph kernels on GPU. In: International Parallel and Distributed Processing Symposium IPDPS.","DOI":"10.1109\/IPDPS47924.2020.00080"},{"key":"bibr101-10943420211029299","unstructured":"Trilinos Project Team. The Trilinos Project Website."},{"key":"bibr102-10943420211029299","doi-asserted-by":"crossref","unstructured":"Tripathy A, Yelick K, Bulu\u00e7 A (2020) Reducing communication in graph neural network training. In: Proceedings of the 2020 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC\u201920.","DOI":"10.1109\/SC41405.2020.00074"},{"key":"bibr103-10943420211029299","volume-title":"Graph clustering by flow simulation","author":"Van Dongen SM","year":"2000"},{"key":"bibr104-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091043"},{"key":"bibr105-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_48"},{"key":"bibr106-10943420211029299","unstructured":"Yang C, Buluc A, Owens JD (2019) Graphblast: a high-performance linear algebra-based graph framework on the gpu. arXiv preprint arXiv:1908.01407."},{"key":"bibr107-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547563"},{"key":"bibr108-10943420211029299","volume-title":"Linear algebra-based triangle counting via fine-grained tasking on heterogeneous environments","author":"Yasar A","year":"2019"},{"key":"bibr109-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.04.009"},{"key":"bibr110-10943420211029299","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976137.5"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420211029299","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420211029299","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420211029299","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420211029299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:17:15Z","timestamp":1777450635000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420211029299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,30]]},"references-count":110,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["10.1177\/10943420211029299"],"URL":"https:\/\/doi.org\/10.1177\/10943420211029299","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,30]]}}}