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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel computing Ročník 44; číslo C; s. 53 - 68
Hlavní autoři: Iverson, J., Kamath, C., Karypis, G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Netherlands Elsevier B.V 01.05.2015
Elsevier
Témata:
Connected component
Distributed-memory
Scalability
Distributed-memory
Scalability
Connected component
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!
Popis
Shrnutí:•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.
Bibliografie:USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
ISSN:0167-8191
1872-7336
DOI:10.1016/j.parco.2015.02.005