Evaluation of connected-component labeling algorithms for distributed-memory systems
•Introduces a graph contraction based distributed-memory connected component algorithm.•Four alternative distributed-memory connected component algorithms are presented.•Theoretical and experimental analysis is presented for the five algorithms.•Classes of problems under which the algorithms are mos...
Uloženo v:
| Vydáno v: | Parallel computing Ročník 44; číslo C; s. 53 - 68 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Netherlands
Elsevier B.V
01.05.2015
Elsevier |
| Témata: | |
| ISSN: | 0167-8191, 1872-7336 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •Introduces a graph contraction based distributed-memory connected component algorithm.•Four alternative distributed-memory connected component algorithms are presented.•Theoretical and experimental analysis is presented for the five algorithms.•Classes of problems under which the algorithms are most applicable are identified.•Novel algorithm shows better scalability across the range of scientific computing graphs used herein.
Connected component labeling is a key step in a wide-range of applications, such as community detection in social networks and coherent structure identification in massively-parallel scientific simulations. There have been several distributed-memory connected component algorithms described in literature; however, little has been done regarding their scalability analysis. Theoretical and experimental results are presented for five algorithms: three that are direct implementations of previous approaches, one that is an implementation of a previous approach that is optimized to reduce communication, and one that is a novel approach based on graph contraction. Under weak scaling and for certain classes of graphs, the graph contraction algorithm scales consistently better than the four other algorithms. Furthermore, it uses significantly less memory than two of the alternative methods and is of the same order in terms of memory as the other two. |
|---|---|
| AbstractList | •Introduces a graph contraction based distributed-memory connected component algorithm.•Four alternative distributed-memory connected component algorithms are presented.•Theoretical and experimental analysis is presented for the five algorithms.•Classes of problems under which the algorithms are most applicable are identified.•Novel algorithm shows better scalability across the range of scientific computing graphs used herein.
Connected component labeling is a key step in a wide-range of applications, such as community detection in social networks and coherent structure identification in massively-parallel scientific simulations. There have been several distributed-memory connected component algorithms described in literature; however, little has been done regarding their scalability analysis. Theoretical and experimental results are presented for five algorithms: three that are direct implementations of previous approaches, one that is an implementation of a previous approach that is optimized to reduce communication, and one that is a novel approach based on graph contraction. Under weak scaling and for certain classes of graphs, the graph contraction algorithm scales consistently better than the four other algorithms. Furthermore, it uses significantly less memory than two of the alternative methods and is of the same order in terms of memory as the other two. |
| Author | Iverson, J. Kamath, C. Karypis, G. |
| Author_xml | – sequence: 1 givenname: J. surname: Iverson fullname: Iverson, J. email: jiverson@cs.umn.edu organization: University of Minnesota, Minneapolis, MN 55455, USA – sequence: 2 givenname: C. surname: Kamath fullname: Kamath, C. email: kamath@llnl.gov organization: Lawrence Livermore National Laboratory, Livermore, CA 94550, USA – sequence: 3 givenname: G. surname: Karypis fullname: Karypis, G. email: karpyis@cs.umn.edu organization: University of Minnesota, Minneapolis, MN 55455, USA |
| BackLink | https://www.osti.gov/biblio/1253427$$D View this record in Osti.gov |
| BookMark | eNqFkD1vwjAQhq2KSgXaX9Al6p7UH0mcDB0qRD8kpC50thz7AkaJjWyDxL9vAkwd2umW57m7952hiXUWEHokOCOYlM-7bC-9chnFpMgwzTAubtCUVJymnLFygqYDxdOK1OQOzULYYYzLvMJTtF4eZXeQ0TibuDZRzlpQEXSqXL8fjtiYdLKBzthNIruN8yZu-5C0zifahOhNcxjpHnrnT0k4hQh9uEe3rewCPFznHH2_LdeLj3T19f65eF2livEipkzXpJJSa1A5tLzmrCBlkwNXsslV3Za65nWFFdC2lVhSVWGdA8W6YWXZkJLN0dNlrwvRiKBMBLW9RhCEFiynfIDqC6S8C8FDKwbuHDh6aTpBsBg7FDtx7lCMHQpMxdDh4LJf7t6bXvrTP9bLxYIh-9GAH18Dq0AbP36mnfnT_wFNd5Ee |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2016_06_002 crossref_primary_10_1109_TAC_2019_2963164 crossref_primary_10_1137_15M1021325 crossref_primary_10_1109_TPDS_2017_2672739 crossref_primary_10_1093_molbev_msx283 crossref_primary_10_1007_s10916_018_1086_3 crossref_primary_10_1109_TPDS_2018_2829724 crossref_primary_10_1109_TVCG_2021_3074584 |
| Cites_doi | 10.1109/TVCG.2007.70554 10.1145/181014.181021 10.1016/0196-6774(82)90008-6 10.1007/BF01383882 10.1007/3-540-45417-9_39 10.1007/978-3-642-32820-6_83 10.1109/AICI.2010.360 10.1007/978-3-642-14390-8_20 10.1109/SC.Companion.2012.100 10.1145/321879.321884 10.1145/359138.359141 10.1103/PhysRevE.76.036106 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | AAYXX CITATION OTOTI |
| DOI | 10.1016/j.parco.2015.02.005 |
| DatabaseName | CrossRef OSTI.GOV |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7336 |
| EndPage | 68 |
| ExternalDocumentID | 1253427 10_1016_j_parco_2015_02_005 S0167819115000435 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1~. 1~5 29O 4.4 457 4G. 5VS 6OB 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE 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 CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SCC SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K WH7 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AALMO ABPIF ABPTK OTOTI |
| ID | FETCH-LOGICAL-c375t-3d918aaddec4ef7973516b4e7cab4c9f6d97980ce2ffa0a2c80d4e20db366b163 |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000353095300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-8191 |
| IngestDate | Mon Jul 24 03:56:59 EDT 2023 Sat Nov 29 07:23:45 EST 2025 Tue Nov 18 21:53:12 EST 2025 Fri Feb 23 02:29:26 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | C |
| Keywords | Distributed-memory Scalability Connected component |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c375t-3d918aaddec4ef7973516b4e7cab4c9f6d97980ce2ffa0a2c80d4e20db366b163 |
| Notes | USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) |
| OpenAccessLink | https://www.osti.gov/biblio/1253427 |
| PageCount | 16 |
| ParticipantIDs | osti_scitechconnect_1253427 crossref_citationtrail_10_1016_j_parco_2015_02_005 crossref_primary_10_1016_j_parco_2015_02_005 elsevier_sciencedirect_doi_10_1016_j_parco_2015_02_005 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-05-01 |
| PublicationDateYYYYMMDD | 2015-05-01 |
| PublicationDate_xml | – month: 05 year: 2015 text: 2015-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Netherlands |
| PublicationPlace_xml | – name: Netherlands |
| PublicationTitle | Parallel computing |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | F. Zhang, S. Lasluisa, T. Jin, I. Rodero, H. Bui, M. Parashar, In-situ feature-based objects tracking for large-scale scientific simulations, in: High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion, 2012, pp. 736–740. doi:10.1109/SC.Companion..100. J. Greiner, A comparison of data-parallel algorithms for connected components, in. Proc. 6th Ann. Symp. Parallel Algorithms And Architectures (SPAA-94), 1994, pp. 16–25. B. Wu, Y. Du, Cloud-based connected component algorithm, in: 2010 International Conference on Artificial Intelligence and Computational Intelligence (AICI), vol. 3, 2010, pp. 122–126. doi:10.1109/AICI.2010.360. Cybenko, Allen, Polito (b0035) 1988; 17 Philips (b0040) 1989 Hirschberg, Chandra, Sarwate (b0025) 1979; 22 Manne, Patwary (b0055) 2010 MSI, Itasca. Buš, Tvrdík (b0060) 2001 Sadlo, Peikert (b0005) 2007; 13 Raghavan, Albert, Kumara (b0065) 2007; 76 Gaither, Childs, Schulz, Harrison, Barth, Donzis, Yeung (b0015) 2012 Krishnamurthy, Lumetta, Culler, Yelick (b0050) 1997; 30 . Kumar, Grama, Gupta, Karypis (b0095) 1994 Kumar, Novak, Tomkins (b0020) 2006 C. Harrison, H. Childs, K.P. Gaither, Data-parallel mesh connected components labeling and analysis, in: Proceedings of the 11th Eurographics Conference on Parallel Graphics and Visualization, EG PGV’11, 2011, pp. 131–140. doi:10.2312/EGPGV/EGPGV11/131-140. Moore (b0085) 1959 Shiloach, Vishkin (b0030) 1982; 3 Seidl, Boden, Fries (b0080) 2012; vol. 7523 Tarjan (b0090) 1975; 22 J. Iverson, C. Kamath, G. Karypis, Fast and effective lossy compression algorithms for scientific datasets, in: Euro-Par 2012 Parallel Processing, 2012, pp. 843–856. G. Karypis, V. Kumar, Multilevel graph partition and sparse matrix ordering, in: Intl. Conf. on Parallel Processing, 1995, pp. 113–122. 10.1016/j.parco.2015.02.005_b0105 Gaither (10.1016/j.parco.2015.02.005_b0015) 2012 Kumar (10.1016/j.parco.2015.02.005_b0020) 2006 Manne (10.1016/j.parco.2015.02.005_b0055) 2010 Hirschberg (10.1016/j.parco.2015.02.005_b0025) 1979; 22 10.1016/j.parco.2015.02.005_b0045 Krishnamurthy (10.1016/j.parco.2015.02.005_b0050) 1997; 30 10.1016/j.parco.2015.02.005_b0100 10.1016/j.parco.2015.02.005_b0075 Sadlo (10.1016/j.parco.2015.02.005_b0005) 2007; 13 Shiloach (10.1016/j.parco.2015.02.005_b0030) 1982; 3 10.1016/j.parco.2015.02.005_b0110 10.1016/j.parco.2015.02.005_b0010 10.1016/j.parco.2015.02.005_b0070 Kumar (10.1016/j.parco.2015.02.005_b0095) 1994 Buš (10.1016/j.parco.2015.02.005_b0060) 2001 Raghavan (10.1016/j.parco.2015.02.005_b0065) 2007; 76 Tarjan (10.1016/j.parco.2015.02.005_b0090) 1975; 22 Cybenko (10.1016/j.parco.2015.02.005_b0035) 1988; 17 Philips (10.1016/j.parco.2015.02.005_b0040) 1989 Seidl (10.1016/j.parco.2015.02.005_b0080) 2012; vol. 7523 Moore (10.1016/j.parco.2015.02.005_b0085) 1959 |
| References_xml | – start-page: 280 year: 2001 end-page: 287 ident: b0060 article-title: A parallel algorithm for connected components on distributed memory machines publication-title: Recent Adv. Parallel Virtual Mach. Message Passing Interface – start-page: 186 year: 2010 end-page: 195 ident: b0055 article-title: A scalable parallel union-find algorithm for distributed memory computers publication-title: Parallel Process. Appl. Math. – reference: F. Zhang, S. Lasluisa, T. Jin, I. Rodero, H. Bui, M. Parashar, In-situ feature-based objects tracking for large-scale scientific simulations, in: High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion, 2012, pp. 736–740. doi:10.1109/SC.Companion..100. – volume: 22 start-page: 215 year: 1975 end-page: 225 ident: b0090 article-title: Efficiency of a good but not linear set union algorithm publication-title: J. ACM (JACM) – reference: G. Karypis, V. Kumar, Multilevel graph partition and sparse matrix ordering, in: Intl. Conf. on Parallel Processing, 1995, pp. 113–122. – volume: 13 start-page: 1456 year: 2007 end-page: 1463 ident: b0005 article-title: Efficient visualization of lagrangian coherent structures by filtered amr ridge extraction publication-title: IEEE Trans. Visualization Comput. Graphics – volume: 22 start-page: 461 year: 1979 end-page: 464 ident: b0025 article-title: Computing connected components on parallel computers publication-title: Commun. ACM – reference: J. Iverson, C. Kamath, G. Karypis, Fast and effective lossy compression algorithms for scientific datasets, in: Euro-Par 2012 Parallel Processing, 2012, pp. 843–856. – reference: . – volume: vol. 7523 start-page: 458 year: 2012 end-page: 473 ident: b0080 article-title: Cc-mr finding connected components in huge graphs with mapreduce publication-title: Machine Learning and Knowledge Discovery in Databases – year: 1994 ident: b0095 publication-title: Introduction to Parallel Computing – volume: 30 start-page: 1 year: 1997 end-page: 21 ident: b0050 article-title: Connected components on distributed memory machines publication-title: Third DIMACS Implementation Challenge – start-page: 611 year: 2006 end-page: 617 ident: b0020 article-title: Structure and evolution of online social networks publication-title: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’06 – volume: 17 start-page: 403 year: 1988 end-page: 423 ident: b0035 article-title: Practical parallel union-find algorithms for transitive closure and clustering publication-title: Int. J. Parallel Programm. – volume: 76 start-page: 036106 year: 2007 ident: b0065 article-title: Near linear time algorithm to detect community structures in large-scale networks publication-title: Phys. Rev. E – reference: C. Harrison, H. Childs, K.P. Gaither, Data-parallel mesh connected components labeling and analysis, in: Proceedings of the 11th Eurographics Conference on Parallel Graphics and Visualization, EG PGV’11, 2011, pp. 131–140. doi:10.2312/EGPGV/EGPGV11/131-140. – reference: MSI, Itasca. – volume: 3 start-page: 57 year: 1982 end-page: 67 ident: b0030 article-title: An o(log n) parallel connectivity algorithm publication-title: J. Algorithms – start-page: 148 year: 1989 end-page: 157 ident: b0040 article-title: Parallel graph contraction publication-title: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA ’89 – reference: J. Greiner, A comparison of data-parallel algorithms for connected components, in. Proc. 6th Ann. Symp. Parallel Algorithms And Architectures (SPAA-94), 1994, pp. 16–25. – start-page: 34 year: 2012 end-page: 35 ident: b0015 article-title: Visual analytics for finding critical structures in massive time-varying turbulent-flow simulations publication-title: Computer Graphics and Applications – reference: B. Wu, Y. Du, Cloud-based connected component algorithm, in: 2010 International Conference on Artificial Intelligence and Computational Intelligence (AICI), vol. 3, 2010, pp. 122–126. doi:10.1109/AICI.2010.360. – year: 1959 ident: b0085 article-title: The Shortest Path through a Maze – start-page: 148 year: 1989 ident: 10.1016/j.parco.2015.02.005_b0040 article-title: Parallel graph contraction – volume: 13 start-page: 1456 issue: 6 year: 2007 ident: 10.1016/j.parco.2015.02.005_b0005 article-title: Efficient visualization of lagrangian coherent structures by filtered amr ridge extraction publication-title: IEEE Trans. Visualization Comput. Graphics doi: 10.1109/TVCG.2007.70554 – ident: 10.1016/j.parco.2015.02.005_b0045 doi: 10.1145/181014.181021 – start-page: 34 year: 2012 ident: 10.1016/j.parco.2015.02.005_b0015 article-title: Visual analytics for finding critical structures in massive time-varying turbulent-flow simulations – volume: 3 start-page: 57 issue: 1 year: 1982 ident: 10.1016/j.parco.2015.02.005_b0030 article-title: An o(log n) parallel connectivity algorithm publication-title: J. Algorithms doi: 10.1016/0196-6774(82)90008-6 – volume: 17 start-page: 403 year: 1988 ident: 10.1016/j.parco.2015.02.005_b0035 article-title: Practical parallel union-find algorithms for transitive closure and clustering publication-title: Int. J. Parallel Programm. doi: 10.1007/BF01383882 – start-page: 280 year: 2001 ident: 10.1016/j.parco.2015.02.005_b0060 article-title: A parallel algorithm for connected components on distributed memory machines publication-title: Recent Adv. Parallel Virtual Mach. Message Passing Interface doi: 10.1007/3-540-45417-9_39 – ident: 10.1016/j.parco.2015.02.005_b0110 – ident: 10.1016/j.parco.2015.02.005_b0100 doi: 10.1007/978-3-642-32820-6_83 – start-page: 611 year: 2006 ident: 10.1016/j.parco.2015.02.005_b0020 article-title: Structure and evolution of online social networks – year: 1959 ident: 10.1016/j.parco.2015.02.005_b0085 – ident: 10.1016/j.parco.2015.02.005_b0070 doi: 10.1109/AICI.2010.360 – start-page: 186 year: 2010 ident: 10.1016/j.parco.2015.02.005_b0055 article-title: A scalable parallel union-find algorithm for distributed memory computers publication-title: Parallel Process. Appl. Math. doi: 10.1007/978-3-642-14390-8_20 – volume: vol. 7523 start-page: 458 year: 2012 ident: 10.1016/j.parco.2015.02.005_b0080 article-title: Cc-mr finding connected components in huge graphs with mapreduce – volume: 30 start-page: 1 year: 1997 ident: 10.1016/j.parco.2015.02.005_b0050 article-title: Connected components on distributed memory machines publication-title: Third DIMACS Implementation Challenge – ident: 10.1016/j.parco.2015.02.005_b0010 doi: 10.1109/SC.Companion.2012.100 – year: 1994 ident: 10.1016/j.parco.2015.02.005_b0095 – ident: 10.1016/j.parco.2015.02.005_b0105 – volume: 22 start-page: 215 issue: 2 year: 1975 ident: 10.1016/j.parco.2015.02.005_b0090 article-title: Efficiency of a good but not linear set union algorithm publication-title: J. ACM (JACM) doi: 10.1145/321879.321884 – volume: 22 start-page: 461 issue: 8 year: 1979 ident: 10.1016/j.parco.2015.02.005_b0025 article-title: Computing connected components on parallel computers publication-title: Commun. ACM doi: 10.1145/359138.359141 – volume: 76 start-page: 036106 issue: 3 year: 2007 ident: 10.1016/j.parco.2015.02.005_b0065 article-title: Near linear time algorithm to detect community structures in large-scale networks publication-title: Phys. Rev. E doi: 10.1103/PhysRevE.76.036106 – ident: 10.1016/j.parco.2015.02.005_b0075 |
| SSID | ssj0006480 |
| Score | 2.2020206 |
| Snippet | •Introduces a graph contraction based distributed-memory connected component algorithm.•Four alternative distributed-memory connected component algorithms are... |
| SourceID | osti crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 53 |
| SubjectTerms | Connected component Distributed-memory Scalability |
| Title | Evaluation of connected-component labeling algorithms for distributed-memory systems |
| URI | https://dx.doi.org/10.1016/j.parco.2015.02.005 https://www.osti.gov/biblio/1253427 |
| Volume | 44 |
| WOSCitedRecordID | wos000353095300004&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 Freedom Collection 2021 customDbUrl: eissn: 1872-7336 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006480 issn: 0167-8191 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZQx4ELMH6IMZh84EiqxHHi-DihAtth2qFIvVm268CmklZpNm3_Pc-_kohCxQ5cosqKrSTf1_ee7efvIfQBprFAWwpzk9qYhAKwiUolT2Qmi0yROi1M7YpNsIuLarHgl-HE9daVE2BNU93d8c1_hRraAGx7dPYBcPeDQgP8BtDhCrDD9Z-An_X63T5lHAyphrAyscnj68Zu_QPw_hS6XH1ft1fdDy_KYDdrfP0ruPunzcC9D0LP23EIeylbW39l5bLRb7ro-iy9bl347ogx7S25hJjY7-OM2tr7jRc3-DIdrztkxZDlF5ciwcTa6d7YllI6MoZeBTi4VV88Z8dg-7WD6-kGsLZnMbPCS6gWg3-Ke_K_ua0-mTDmqV0LN4iwg4iUCCdte0BYwcHaHZyezRbnvY8uqaup179D1KNymX87z_K3mGWyBjM8Ckfmz9HTMI_Apx7_Q_TINC_Qs1ijAweT_RLNBzrgdY3_QAcc6YAHOmCgA96lAw50eIW-fZ7NP31NQiWNROes6JJ8ybNKWlemqakZZ3mRlYoapqWimtflkjNepdqQupapJLpKl9SQdKnyslQQsr9Gkwae6Y09488lITCQKVMKc12lqTJGUs1UXleFOkIkfiuhg8y8rXayEntwOkIf-04br7Ky__YygiBCoOgDQAG02t_x2EJmO1mJ5PDNBQT5OSXs7cOe4hg9Gf4X79Cka2_Me_RY33ZX2_YkMO4X8hqYkw |
| 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=Evaluation+of+connected-component+labeling+algorithms+for+distributed-memory+systems&rft.jtitle=Parallel+computing&rft.au=Iverson%2C+J.&rft.au=Kamath%2C+C.&rft.au=Karypis%2C+G.&rft.date=2015-05-01&rft.issn=0167-8191&rft.volume=44&rft.spage=53&rft.epage=68&rft_id=info:doi/10.1016%2Fj.parco.2015.02.005&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_parco_2015_02_005 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-8191&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-8191&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-8191&client=summon |