Evaluation of Connected-Component Labeling Algorithms for Distributed-Memory Systems
2014-07-30
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Evaluation of Connected-Component Labeling Algorithms for Distributed-Memory Systems
Published Date
2014-07-30
Publisher
Type
Report
Abstract
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. We present theoretical and experimental results 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.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Iverson, Jeremy; Karypis, George; Kamath, Chandrika. (2014). Evaluation of Connected-Component Labeling Algorithms for Distributed-Memory Systems. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215954.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.