Skip to main content
SpringerLink
Log in

A Parallel Algorithm for Connected Components on Distributed Memory Machines

  • Conference paper
  • First Online:
Book cover Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2131))

Abstract

Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distributed memory machines have been described in the literature, all in Split-C. We have designed and implemented a CC algorithm in C++ and MPI, by combining the ideas of the previous PRAM and distributed memory algorithms. Our main optimization is based on replacing the conditional hooking by rules for reducing nontrivial cycles during the contraction of components. We have also implemented a method for reducing the number of exchanged messages which is based on buffering messages and on deferred processing of answers.

This research has been supported by MSMT Czech Republic under research program #J04/98:2123000

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Bader and J. JáJá. Parallel algorithms for image histogramming and connected components with an experimental study. Journal of Parallel and Distributed Computing, 35(2):173–190, 1996.

    Article  Google Scholar 

  2. K. W. Chong and T. W. Lam. Finding connected components in O(lognloglogn) time on the EREW PRAM. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1993.

    Google Scholar 

  3. J. Greiner. A comparison of data-parallel algorithms for connected components. In Proceedings of SPAA, pages 16–25, June 94.

    Google Scholar 

  4. T. S. Hsu, V. Ramachandran, and N. Dean. Parallel implementation of algorithms for finding connected components. In Proceedings of the 3rd Annual DIMACS Challenge, 1995.

    Google Scholar 

  5. D. B. Johnson and P. Metaxas. Connected components in O(log3/2 n) parallel time for the CREW PRAM. In 32nd FOCS, pages 688–697, 1991. PCS-TR91-160.

    Google Scholar 

  6. A. Krishnamurthy, S. Lumetta, D. Culler, and K. Yelick. Connected components on distributed memory machines. In Proceedings of the 3rd Annual DIMACS Challenge, 1995.

    Google Scholar 

  7. Y. Shiloach and U. Vishkin. An O(logn) parallel connectivity algorithm. Journal of Algorithms, 3(1):57–67, March 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Czech Technical University, Karlovo nám. 13, 121 35, Prague, Czech Republic

    Libor Buš & Pavel Tvrdík

Authors
  1. Libor Buš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Tvrdík
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Telecommunications, University of Athens, Panepistimiopolis, 157 84, Greece

    Yiannis Cotronis

  2. Innovative Computing Lab., Computer Science Department, University of Tennessee, 1122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buš, L., Tvrdík, P. (2001). A Parallel Algorithm for Connected Components on Distributed Memory Machines. In: Cotronis, Y., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2001. Lecture Notes in Computer Science, vol 2131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45417-9_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45417-9_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42609-7

  • Online ISBN: 978-3-540-45417-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation