Abstract
Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds, where p is the number of processors. It requires the solution of the Euler tour problem which in turn is based on the solution of the list ranking problem. We present a new approach that does not need to solve the Euler tour or the list ranking problem. It is based on the integer sorting algorithm which can be implemented efficiently on the BSP/CGM model [1].
Partially supported by FINEP-PRONEX-SAI Proc. No. 76.97.1022.00, CNPq Proc. No. 30.0317/02-6, 30.5218/03-4, 47.0163/03-8, 55.2028/02-9, FUNDECT-MS Proc. No. 41/100117/03, and the Natural Sciences and Engineering Research Council of Canada. We would also like to thank the anonymous referees for their review and helpful comments.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chan, A., Dehne, F.: A note on coarse grained parallel integer sorting. Parallel Processing Letters 9, 533–538 (1999)
Hirschberg, D.S., Chandra, A.K., Sarwate, D.V.: Computing connected components on parallel computers. Comm. ACM 22, 461–464 (1979)
Karp, R.M., Ramachandran, V.: 17. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 869–941. Elsevier/MIT Press (1990)
Dehne, F., Ferreira, A., Cáceres, E., Song, S.W., Roncato, A.: Efficient parallel graph algorithms for coarse grained multicomputers and BSP. Algorithmica 33, 183–200 (2002)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel geometric algorithms for coarse grained multicomputers. In: Proc. ACM 9th Annual Computational Geometry, pp. 298–307 (1993)
Cáceres, E.N., Dehne, F., Mongelli, H., Song, S.W., Szwarcfiter, J.L.: A coarsegrained parallel algorithm for spanning tree and connected components. Technical report (2003), USP http://www.ime.usp.br/~song/papers/span.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cáceres, E.N., Dehne, F., Mongelli, H., Song, S.W., Szwarcfiter, J.L. (2004). A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_110
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive