Parallel algorithms for finding connected components using linear algebra
Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computat...
Gespeichert in:
| Veröffentlicht in: | Journal of parallel and distributed computing Jg. 144; H. C; S. 14 - 27 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
Elsevier Inc
01.10.2020
Elsevier |
| Schlagworte: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. We demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights. |
|---|---|
| AbstractList | Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. We demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights. |
| Author | Azad, Ariful Buluç, Aydın Zhang, Yongzhe |
| Author_xml | – sequence: 1 givenname: Yongzhe surname: Zhang fullname: Zhang, Yongzhe email: zyz915@nii.ac.jp organization: Department of Informatics, The Graduate University for Advanced Studies, SOKENDAI, Japan – sequence: 2 givenname: Ariful surname: Azad fullname: Azad, Ariful email: azad@iu.edu organization: Department of Intelligent Systems Engineering, Indiana University, Bloomington, IN, USA – sequence: 3 givenname: Aydın surname: Buluç fullname: Buluç, Aydın email: abuluc@lbl.gov organization: Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA, USA |
| BackLink | https://www.osti.gov/biblio/1632022$$D View this record in Osti.gov |
| BookMark | eNp9kE9rwyAYh2V0sLbbF9gp7J7sVWNMYJdR9qdQ2A7bWaya1pBqUTfYt5-hO-3Qk4K_531_Pgs0c94ZhG4xVBhwcz9Uw1GrigCBCuoKoLtAcwxdU0JbtzM0B17TklPMrtAixgEAY8bbOVq_yyDH0YyFHHc-2LQ_xKL3oeit09btCuWdMyoZnW-HY97qUiy-4vQ0WmdkmECzDfIaXfZyjObm71yiz-enj9VruXl7Wa8eN6WiHKdS96QjUm27ppWUaFDcKM1rkC3lijKJ654p0iima6rZFhjFwDhTHIBQ01G6RHenuT4mK6Kyyaj9X0uBG5odkBxqTyEVfIzB9CLnZLLepSDtKDCIyZsYxORNTN4E1CJ7yyj5hx6DPcjwcx56OEEm__zbmjAVM04ZbcPUS3t7Dv8FX8aJBg |
| CitedBy_id | crossref_primary_10_1515_rnam_2023_0028 crossref_primary_10_1007_s11227_021_04072_0 crossref_primary_10_1145_3564593 crossref_primary_10_1145_3606932 crossref_primary_10_1177_10943420211029299 crossref_primary_10_1007_s42514_021_00070_z crossref_primary_10_1109_ACCESS_2022_3233786 crossref_primary_10_1145_3466795 crossref_primary_10_1145_3577195 crossref_primary_10_1155_2023_2025844 |
| Cites_doi | 10.1177/1094342011403516 10.14778/2809974.2809983 10.1145/2612669.2612692 10.1145/3322125 10.1109/SC.2018.00013 10.1093/nar/gkx1313 10.1109/IPDPSW.2019.00053 10.1145/98267.98287 10.1109/IPDPS.2018.00012 10.1137/S0097539700371065 10.1109/IPDPSW.2017.117 10.1145/3209689 10.1109/IPDPS.2016.93 10.1177/1094342005051521 10.1016/0196-6774(82)90008-6 10.1109/MC.2015.215 10.1109/TPDS.2017.2672739 10.1109/TC.1987.1676869 10.1006/jcss.1996.0078 10.1137/0220066 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier Inc. |
| Copyright_xml | – notice: 2020 Elsevier Inc. |
| DBID | AAYXX CITATION OTOTI |
| DOI | 10.1016/j.jpdc.2020.04.009 |
| DatabaseName | CrossRef OSTI.GOV |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 27 |
| ExternalDocumentID | 1632022 10_1016_j_jpdc_2020_04_009 S0743731520302689 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AALMO ABPIF EFJIC OTOTI |
| ID | FETCH-LOGICAL-c371t-df292acb968a32d0c7ecd740a837c35a14f5c26c5d43d5b05310575c70023e933 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000546677400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Fri May 19 00:40:33 EDT 2023 Sat Nov 29 07:09:13 EST 2025 Tue Nov 18 22:25:07 EST 2025 Fri Feb 23 02:47:41 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | C |
| Keywords | Distributed memory Connected Component GraphBLAS |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c371t-df292acb968a32d0c7ecd740a837c35a14f5c26c5d43d5b05310575c70023e933 |
| Notes | USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) AC02-05CH11231; 17-SC-20-SC |
| OpenAccessLink | https://www.osti.gov/biblio/1632022 |
| PageCount | 14 |
| ParticipantIDs | osti_scitechconnect_1632022 crossref_citationtrail_10_1016_j_jpdc_2020_04_009 crossref_primary_10_1016_j_jpdc_2020_04_009 elsevier_sciencedirect_doi_10_1016_j_jpdc_2020_04_009 |
| PublicationCentury | 2000 |
| PublicationDate | October 2020 2020-10-00 2020-10-01 |
| PublicationDateYYYYMMDD | 2020-10-01 |
| PublicationDate_xml | – month: 10 year: 2020 text: October 2020 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2020 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Beamer, Asanović, Patterson (b5) 2015 Van Dongen (b41) 2000 Azad, Pavlopoulos, Ouzounis, Kyrpides, Buluç (b4) 2018; 46 Halperin, Zwick (b19) 1996; 53 G.M. Slota, S. Rajamanickam, K. Madduri, A case study of complex graph analysis in distributed memory: Implementation and optimization, in: Proceedings of IPDPS, 2016, pp. 293–302. Pettie, Ramachandran (b27) 2002; 31 Yang, Buluç, Owens (b42) 2019 Thornquist, Keiter, Hoekstra, Day, Boman (b39) 2009 E. Georganas, R. Egan, S. Hofmeyr, E. Goltsman, B. Arndt, A. Tritt, A. Buluc, L. Oliker, K. Yelick, Extreme scale de novo metagenome assembly, in: Proceedings of SC, 2018. J. Shun, L. Dhulipala, G. Blelloch, A simple and practical linear-work parallel algorithm for connectivity, in: Proceedings of SPAA, 2014, pp. 143–153. Sundaram, Satish, Patwary, Dulloor, Anderson, Vadlamudi, Das, Dubey (b36) 2015; 8 Buluç, Gilbert (b6) 2011; 25 A. Buluç, T. Mattson, S. McMillan, J. Moreira, C. Yang, Design of the GraphBLAS API for C, in: IPDPS Workshops, 2017, pp. 643–652. A. Buluç, T. Mattson, S. McMillan, J. Moreira, C. Yang, Design of the GraphBLAS API for C, in: IPDPS Workshops, 2017. Kiveris, Lattanzi, Mirrokni, Rastogi, Vassilvitskii (b23) 2014 M. Sutton, T. Ben-Nun, A. Barak, Optimizing parallel graph connectivity computation via subgraph sampling, in: Proceedings of IPDPS, 2018, pp. 12–21. Träff (b40) 2010 Buluç, Mattson, McMillan, Moreira, Yang (b8) 2018 Pothen, Fan (b28) 1990; 16 Zhang, Ko, Hu (b44) 2017 Jain, Flick, Pan, Green, Aluru (b20) 2017; 28 Davis, Hu (b12) 2011; 38 Gazit (b15) 1991; 20 Shah (b30) 2007 Ekanadham, Horn, Kumar, Jann, Moreira, Pattnaik, Serrano, Tanase, Yu (b14) 2016 Andoni, Song, Stein, Wang, Zhong (b1) 2018 Dhulipala, Blelloch, Shun (b13) 2018 Kepner, Gilbert (b22) 2011 Nurk, Meleshko, Korobeynikov, Pevzner (b25) 2017 Shun, Blelloch (b32) 2013 Azad, Buluç (b3) 2019 Cong, Almasi, Saraswat (b10) 2009 George, Gilbert, Liu (b17) 2012 Zhang, Azad, Hu (b43) 2020 Davis (b11) 2019; 45 Zhao, Canny (b45) 2014 Ji, Liu, Huang (b21) 2018 T. Mattson, T.A. Davis, M. Kumar, A. Buluç, S. McMillan, J. Moreira, C. Yang, LAGraph: A community effort to collect graph algorithms built on top of the GraphBLAS, in: IPDPS Workshops, 2019, pp. 276–284. Thakur, Rabenseifner, Gropp (b38) 2005; 19 Pandurangan, Robinson, Scquizzato (b26) 2018; 5 Reif (b29) 1985 Halappanavar, Pothen, Azad, Manne, Langguth, Khan (b18) 2015 Shiloach, Vishkin (b31) 1982; 3 Awerbuch, Shiloach (b2) 1987; 10 Sundar, Malhotra, Biros (b35) 2013 Halperin (10.1016/j.jpdc.2020.04.009_b19) 1996; 53 Sundar (10.1016/j.jpdc.2020.04.009_b35) 2013 Awerbuch (10.1016/j.jpdc.2020.04.009_b2) 1987; 10 Dhulipala (10.1016/j.jpdc.2020.04.009_b13) 2018 Zhao (10.1016/j.jpdc.2020.04.009_b45) 2014 10.1016/j.jpdc.2020.04.009_b16 Shun (10.1016/j.jpdc.2020.04.009_b32) 2013 Buluç (10.1016/j.jpdc.2020.04.009_b8) 2018 Sundaram (10.1016/j.jpdc.2020.04.009_b36) 2015; 8 Davis (10.1016/j.jpdc.2020.04.009_b11) 2019; 45 Cong (10.1016/j.jpdc.2020.04.009_b10) 2009 Azad (10.1016/j.jpdc.2020.04.009_b4) 2018; 46 10.1016/j.jpdc.2020.04.009_b24 Reif (10.1016/j.jpdc.2020.04.009_b29) 1985 Beamer (10.1016/j.jpdc.2020.04.009_b5) 2015 Pettie (10.1016/j.jpdc.2020.04.009_b27) 2002; 31 Pothen (10.1016/j.jpdc.2020.04.009_b28) 1990; 16 Ekanadham (10.1016/j.jpdc.2020.04.009_b14) 2016 Shah (10.1016/j.jpdc.2020.04.009_b30) 2007 Andoni (10.1016/j.jpdc.2020.04.009_b1) 2018 Jain (10.1016/j.jpdc.2020.04.009_b20) 2017; 28 Kepner (10.1016/j.jpdc.2020.04.009_b22) 2011 Buluç (10.1016/j.jpdc.2020.04.009_b6) 2011; 25 Kiveris (10.1016/j.jpdc.2020.04.009_b23) 2014 Thornquist (10.1016/j.jpdc.2020.04.009_b39) 2009 Azad (10.1016/j.jpdc.2020.04.009_b3) 2019 Ji (10.1016/j.jpdc.2020.04.009_b21) 2018 Gazit (10.1016/j.jpdc.2020.04.009_b15) 1991; 20 George (10.1016/j.jpdc.2020.04.009_b17) 2012 Davis (10.1016/j.jpdc.2020.04.009_b12) 2011; 38 Nurk (10.1016/j.jpdc.2020.04.009_b25) 2017 Van Dongen (10.1016/j.jpdc.2020.04.009_b41) 2000 Yang (10.1016/j.jpdc.2020.04.009_b42) 2019 Zhang (10.1016/j.jpdc.2020.04.009_b43) 2020 Pandurangan (10.1016/j.jpdc.2020.04.009_b26) 2018; 5 Shiloach (10.1016/j.jpdc.2020.04.009_b31) 1982; 3 Thakur (10.1016/j.jpdc.2020.04.009_b38) 2005; 19 Träff (10.1016/j.jpdc.2020.04.009_b40) 2010 10.1016/j.jpdc.2020.04.009_b33 10.1016/j.jpdc.2020.04.009_b34 10.1016/j.jpdc.2020.04.009_b37 Halappanavar (10.1016/j.jpdc.2020.04.009_b18) 2015 Zhang (10.1016/j.jpdc.2020.04.009_b44) 2017 10.1016/j.jpdc.2020.04.009_b7 10.1016/j.jpdc.2020.04.009_b9 |
| References_xml | – volume: 46 start-page: e33 year: 2018 ident: b4 article-title: HipMCL: A high-performance parallel implementation of the Markov clustering algorithm for large-scale networks publication-title: Nucleic Acids Res. – year: 2015 ident: b5 article-title: The GAP benchmark suite – reference: G.M. Slota, S. Rajamanickam, K. Madduri, A case study of complex graph analysis in distributed memory: Implementation and optimization, in: Proceedings of IPDPS, 2016, pp. 293–302. – start-page: 301 year: 2017 end-page: 320 ident: b44 article-title: Palgol: A high-level DSL for vertex-centric graph processing with remote data access publication-title: Proceedings of the 15th Asian Symposium on Programming Languages and Systems – volume: 19 start-page: 49 year: 2005 end-page: 66 ident: b38 article-title: Optimization of collective communication operations in MPICH publication-title: Int. J. High Perform. Comput. Appl. – volume: 3 start-page: 57 year: 1982 end-page: 67 ident: b31 article-title: An O(logn) parallel connectivity algorithm publication-title: J. Algorithms – reference: E. Georganas, R. Egan, S. Hofmeyr, E. Goltsman, B. Arndt, A. Tritt, A. Buluc, L. Oliker, K. Yelick, Extreme scale de novo metagenome assembly, in: Proceedings of SC, 2018. – start-page: 410 year: 2009 end-page: 417 ident: b39 article-title: A parallel preconditioning strategy for efficient transistor-level circuit simulation publication-title: Intl. Conf. on Computer-Aided Design – volume: 8 start-page: 1214 year: 2015 end-page: 1225 ident: b36 article-title: GraphMat: HIgh performance graph analytics made productive publication-title: Proc. VLDB Endow. – year: 2007 ident: b30 article-title: An Interactive System for Combinatorial Scientific Computing with an Emphasis on Programmer Productivity – start-page: 674 year: 2018 end-page: 685 ident: b1 article-title: Parallel graph connectivity in log diameter rounds publication-title: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, FOCS – start-page: 13 year: 2009 ident: b10 article-title: Fast PGAS connected components algorithms publication-title: Third Conference on PGAS Programing Models – reference: J. Shun, L. Dhulipala, G. Blelloch, A simple and practical linear-work parallel algorithm for connectivity, in: Proceedings of SPAA, 2014, pp. 143–153. – volume: 45 start-page: 1 year: 2019 end-page: 25 ident: b11 article-title: Algorithm 1000: Suitesparse: GraphBLAS: Graph algorithms in the language of sparse linear algebra publication-title: ACM Trans. Math. Software – start-page: 731 year: 2018 end-page: 742 ident: b21 article-title: iSpan: Parallel identification of strongly connected components with spanning trees publication-title: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis – volume: 25 start-page: 496 year: 2011 end-page: 509 ident: b6 article-title: The Combinatorial BLAS: Design, implementation, and applications publication-title: Int. J. High Perform. Comput. Appl. – year: 2018 ident: b8 article-title: The GraphBLAS C API Specification – volume: 20 start-page: 1046 year: 1991 end-page: 1067 ident: b15 article-title: An optimal randomized parallel algorithm for finding connected components in a graph publication-title: SIAM J. Comput. – volume: 5 start-page: 4 year: 2018 ident: b26 article-title: Fast distributed algorithms for connectivity and MST in large graphs publication-title: ACM Trans. Parallel Comput. – start-page: 1 year: 2014 end-page: 13 ident: b23 article-title: Connected components in MapReduce and beyond publication-title: Proceedings of the ACM Symposium on Cloud Computing – reference: M. Sutton, T. Ben-Nun, A. Barak, Optimizing parallel graph connectivity computation via subgraph sampling, in: Proceedings of IPDPS, 2018, pp. 12–21. – start-page: 2 year: 2019 end-page: 12 ident: b3 article-title: LACC: A linear-algebraic algorithm for finding connected components in distributed memory publication-title: Proceedings of the IPDPS – start-page: 293 year: 2013 end-page: 302 ident: b35 article-title: HykSort: a new variant of hypercube quicksort on distributed memory architectures publication-title: Proceedings ICS – volume: 38 start-page: 1 year: 2011 ident: b12 article-title: The University of Florida sparse matrix collection publication-title: ACM Trans. Math. Software – year: 2000 ident: b41 article-title: Graph Clustering By Flow Simulation – start-page: gr year: 2017 end-page: 213959 ident: b25 article-title: metaSPAdes: a new versatile metagenomic assembler publication-title: Genome Res. – year: 2019 ident: b42 article-title: GraphBLAST: A High-performance linear algebra-based graph framework on the GPU – year: 2012 ident: b17 article-title: Graph Theory and Sparse Matrix Computation, vol. 56 – volume: 31 start-page: 1879 year: 2002 end-page: 1895 ident: b27 article-title: A randomized time-work optimal parallel algorithm for finding a minimum spanning forest publication-title: SIAM J. Comput. – year: 2011 ident: b22 article-title: Graph Algorithms in the Language of Linear Algebra – start-page: 72 year: 2016 end-page: 81 ident: b14 article-title: Graph Programming Interface (GPI): A linear algebra programming model for large scale graph computations publication-title: Computing Frontiers (CF) – start-page: 46 year: 2020 end-page: 57 ident: b43 article-title: FastSV: A distributed-memory connected component algorithm with fast convergence publication-title: Proceedings of the 2020 SIAM Conference on Parallel Processing for Scientific Computing – start-page: 273 year: 2014 end-page: 282 ident: b45 article-title: Kylix: A sparse allreduce for commodity clusters publication-title: Proceedings of ICPP – year: 1985 ident: b29 article-title: Optimal Parallel Algorithms for Integer Sorting and Graph Connectivity – volume: 16 start-page: 303 year: 1990 end-page: 324 ident: b28 article-title: Computing the block triangular form of a sparse matrix publication-title: ACM Trans. Math. Software – reference: A. Buluç, T. Mattson, S. McMillan, J. Moreira, C. Yang, Design of the GraphBLAS API for C, in: IPDPS Workshops, 2017, pp. 643–652. – start-page: 393 year: 2018 end-page: 404 ident: b13 article-title: Theoretically efficient parallel graph algorithms can be fast and scalable publication-title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures – start-page: 275 year: 2010 end-page: 284 ident: b40 article-title: Transparent neutral element elimination in MPI reduction operations publication-title: European MPI Users’ Group Meeting – start-page: 46 year: 2015 end-page: 55 ident: b18 article-title: Codesign lessons learned from implementing graph matching on multithreaded architectures publication-title: Computer – volume: 28 start-page: 2428 year: 2017 end-page: 2439 ident: b20 article-title: An adaptive parallel algorithm for computing connected components publication-title: IEEE Trans. Parallel Distrib. Syst. – reference: T. Mattson, T.A. Davis, M. Kumar, A. Buluç, S. McMillan, J. Moreira, C. Yang, LAGraph: A community effort to collect graph algorithms built on top of the GraphBLAS, in: IPDPS Workshops, 2019, pp. 276–284. – volume: 10 start-page: 1258 year: 1987 end-page: 1263 ident: b2 article-title: New connectivity and MSF algorithms for shuffle-exchange network and PRAM publication-title: IEEE Trans. Comput. – volume: 53 start-page: 395 year: 1996 end-page: 416 ident: b19 article-title: An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM publication-title: J. Comput. System Sci. – reference: A. Buluç, T. Mattson, S. McMillan, J. Moreira, C. Yang, Design of the GraphBLAS API for C, in: IPDPS Workshops, 2017. – start-page: 135 year: 2013 end-page: 146 ident: b32 article-title: Ligra: A lightweight graph processing framework for shared memory publication-title: ACM Sigplan Notices, vol. 48 – volume: 25 start-page: 496 issue: 4 year: 2011 ident: 10.1016/j.jpdc.2020.04.009_b6 article-title: The Combinatorial BLAS: Design, implementation, and applications publication-title: Int. J. High Perform. Comput. Appl. doi: 10.1177/1094342011403516 – start-page: 731 year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b21 article-title: iSpan: Parallel identification of strongly connected components with spanning trees – volume: 8 start-page: 1214 issue: 11 year: 2015 ident: 10.1016/j.jpdc.2020.04.009_b36 article-title: GraphMat: HIgh performance graph analytics made productive publication-title: Proc. VLDB Endow. doi: 10.14778/2809974.2809983 – volume: 38 start-page: 1 issue: 1 year: 2011 ident: 10.1016/j.jpdc.2020.04.009_b12 article-title: The University of Florida sparse matrix collection publication-title: ACM Trans. Math. Software – start-page: 46 year: 2020 ident: 10.1016/j.jpdc.2020.04.009_b43 article-title: FastSV: A distributed-memory connected component algorithm with fast convergence – year: 1985 ident: 10.1016/j.jpdc.2020.04.009_b29 – ident: 10.1016/j.jpdc.2020.04.009_b33 doi: 10.1145/2612669.2612692 – year: 2019 ident: 10.1016/j.jpdc.2020.04.009_b42 – volume: 45 start-page: 1 issue: 4 year: 2019 ident: 10.1016/j.jpdc.2020.04.009_b11 article-title: Algorithm 1000: Suitesparse: GraphBLAS: Graph algorithms in the language of sparse linear algebra publication-title: ACM Trans. Math. Software doi: 10.1145/3322125 – start-page: 293 year: 2013 ident: 10.1016/j.jpdc.2020.04.009_b35 article-title: HykSort: a new variant of hypercube quicksort on distributed memory architectures – start-page: 275 year: 2010 ident: 10.1016/j.jpdc.2020.04.009_b40 article-title: Transparent neutral element elimination in MPI reduction operations – start-page: 301 year: 2017 ident: 10.1016/j.jpdc.2020.04.009_b44 article-title: Palgol: A high-level DSL for vertex-centric graph processing with remote data access – ident: 10.1016/j.jpdc.2020.04.009_b16 doi: 10.1109/SC.2018.00013 – volume: 46 start-page: e33 issue: 6 year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b4 article-title: HipMCL: A high-performance parallel implementation of the Markov clustering algorithm for large-scale networks publication-title: Nucleic Acids Res. doi: 10.1093/nar/gkx1313 – ident: 10.1016/j.jpdc.2020.04.009_b24 doi: 10.1109/IPDPSW.2019.00053 – volume: 16 start-page: 303 issue: 4 year: 1990 ident: 10.1016/j.jpdc.2020.04.009_b28 article-title: Computing the block triangular form of a sparse matrix publication-title: ACM Trans. Math. Software doi: 10.1145/98267.98287 – ident: 10.1016/j.jpdc.2020.04.009_b37 doi: 10.1109/IPDPS.2018.00012 – volume: 31 start-page: 1879 issue: 6 year: 2002 ident: 10.1016/j.jpdc.2020.04.009_b27 article-title: A randomized time-work optimal parallel algorithm for finding a minimum spanning forest publication-title: SIAM J. Comput. doi: 10.1137/S0097539700371065 – start-page: 135 year: 2013 ident: 10.1016/j.jpdc.2020.04.009_b32 article-title: Ligra: A lightweight graph processing framework for shared memory – start-page: 273 year: 2014 ident: 10.1016/j.jpdc.2020.04.009_b45 article-title: Kylix: A sparse allreduce for commodity clusters – start-page: 13 year: 2009 ident: 10.1016/j.jpdc.2020.04.009_b10 article-title: Fast PGAS connected components algorithms – start-page: 410 year: 2009 ident: 10.1016/j.jpdc.2020.04.009_b39 article-title: A parallel preconditioning strategy for efficient transistor-level circuit simulation – year: 2015 ident: 10.1016/j.jpdc.2020.04.009_b5 – ident: 10.1016/j.jpdc.2020.04.009_b9 doi: 10.1109/IPDPSW.2017.117 – start-page: 1 year: 2014 ident: 10.1016/j.jpdc.2020.04.009_b23 article-title: Connected components in MapReduce and beyond – volume: 5 start-page: 4 issue: 1 year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b26 article-title: Fast distributed algorithms for connectivity and MST in large graphs publication-title: ACM Trans. Parallel Comput. doi: 10.1145/3209689 – ident: 10.1016/j.jpdc.2020.04.009_b34 doi: 10.1109/IPDPS.2016.93 – volume: 19 start-page: 49 issue: 1 year: 2005 ident: 10.1016/j.jpdc.2020.04.009_b38 article-title: Optimization of collective communication operations in MPICH publication-title: Int. J. High Perform. Comput. Appl. doi: 10.1177/1094342005051521 – volume: 3 start-page: 57 issue: 1 year: 1982 ident: 10.1016/j.jpdc.2020.04.009_b31 article-title: An O(logn) parallel connectivity algorithm publication-title: J. Algorithms doi: 10.1016/0196-6774(82)90008-6 – start-page: 393 year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b13 article-title: Theoretically efficient parallel graph algorithms can be fast and scalable – start-page: 72 year: 2016 ident: 10.1016/j.jpdc.2020.04.009_b14 article-title: Graph Programming Interface (GPI): A linear algebra programming model for large scale graph computations – year: 2012 ident: 10.1016/j.jpdc.2020.04.009_b17 – year: 2011 ident: 10.1016/j.jpdc.2020.04.009_b22 – start-page: 46 issue: 8 year: 2015 ident: 10.1016/j.jpdc.2020.04.009_b18 article-title: Codesign lessons learned from implementing graph matching on multithreaded architectures publication-title: Computer doi: 10.1109/MC.2015.215 – volume: 28 start-page: 2428 issue: 9 year: 2017 ident: 10.1016/j.jpdc.2020.04.009_b20 article-title: An adaptive parallel algorithm for computing connected components publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2017.2672739 – start-page: 674 year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b1 article-title: Parallel graph connectivity in log diameter rounds – ident: 10.1016/j.jpdc.2020.04.009_b7 doi: 10.1109/IPDPSW.2017.117 – volume: 10 start-page: 1258 issue: C-36 year: 1987 ident: 10.1016/j.jpdc.2020.04.009_b2 article-title: New connectivity and MSF algorithms for shuffle-exchange network and PRAM publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1987.1676869 – start-page: 2 year: 2019 ident: 10.1016/j.jpdc.2020.04.009_b3 article-title: LACC: A linear-algebraic algorithm for finding connected components in distributed memory – volume: 53 start-page: 395 issue: 3 year: 1996 ident: 10.1016/j.jpdc.2020.04.009_b19 article-title: An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM publication-title: J. Comput. System Sci. doi: 10.1006/jcss.1996.0078 – year: 2018 ident: 10.1016/j.jpdc.2020.04.009_b8 – volume: 20 start-page: 1046 issue: 6 year: 1991 ident: 10.1016/j.jpdc.2020.04.009_b15 article-title: An optimal randomized parallel algorithm for finding connected components in a graph publication-title: SIAM J. Comput. doi: 10.1137/0220066 – year: 2000 ident: 10.1016/j.jpdc.2020.04.009_b41 – start-page: gr year: 2017 ident: 10.1016/j.jpdc.2020.04.009_b25 article-title: metaSPAdes: a new versatile metagenomic assembler publication-title: Genome Res. – year: 2007 ident: 10.1016/j.jpdc.2020.04.009_b30 |
| SSID | ssj0011578 |
| Score | 2.3912177 |
| Snippet | Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a... |
| SourceID | osti crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 14 |
| SubjectTerms | Connected Component Distributed memory GraphBLAS |
| Title | Parallel algorithms for finding connected components using linear algebra |
| URI | https://dx.doi.org/10.1016/j.jpdc.2020.04.009 https://www.osti.gov/biblio/1632022 |
| Volume | 144 |
| WOSCitedRecordID | wos000546677400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLeqjgMXxvgQYzD5wG0KSmI7To4dGmIITTsMqZwi1062VVVahWba9tfznj-SaqgTO3CJojR2E79f3vvZ78OEfAJSPlNC6SgWtYk4q1SkeFZFPAc9KZiqY24ThX_Is7N8Oi3OR6Mu5MLcLGTT5Le3xeq_ihqugbAxdfYJ4u47hQtwDkKHI4gdjv8k-HPV4v4oGHl8uYSp_5UruXBkvdM2wxZUq0aiieHky8amuHV2yQApp2qxIbqTt_DWVd9_Y9C_47bM8t1162AKNxejfy2by_urAVz3DleT9roe4hKPu0Vn3fbS_nZnkOceJ83mugRMQkOEW1BfWPxUMpes2etazje0pUsf9XbXlQj4S6O7xYX55_nKYMXJNLaVaeNisF_BZ__ArPXBhiGObV5iHyX2Uca8tGmfO6kUBejzncnpyfR7735KhDPh4RV8tpULDHz4JNsYzXgJSnqDrFy8JC-8tOjEoWOPjKrmFdkNO3hQr9Bfk9MAFjqAhQJYqAcL7cFCB7BQCxbqwEI9WN6Qn19PLr58i_zmGpFmMllHpk6LVOlZkeWKpSbWstJG8ljlTGomVMJrodNMC8OZETPU1UjttUSWVxWMvSXjBv72HaFZAZ_7LMlVlsNk3gDnzIpUQuO6qlKdZ_skCQNUal95HjdAWZTbRbNPjvo2K1d35dG7RRj30jNHxwhLgNGj7Q5QSNgGSyb7MS1hjgI3pe-f9AwH5PnwGXwg43XbVR_JM32zvv7dHnqE_QG65ZjY |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+algorithms+for+finding+connected+components+using+linear+algebra&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Zhang%2C+Yongzhe&rft.au=Azad%2C+Ariful&rft.au=Bulu%C3%A7%2C+Ayd%C4%B1n&rft.date=2020-10-01&rft.issn=0743-7315&rft.volume=144&rft.spage=14&rft.epage=27&rft_id=info:doi/10.1016%2Fj.jpdc.2020.04.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jpdc_2020_04_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |