Abstract:
We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are...Show MoreMetadata
Abstract:
We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are asynchronous, distributed-memory machines. Analysis of our parallel algorithm on a simple model that is reminiscent of the LogP model, shows that in principle a speedup proportional to the number of processors can be achieved, but that communication costs can be significant. To reduce these costs, we develop a new randomized linear work pointer jumping scheme that performs better than previous linear work algorithms. We also consider empirically the effects of data imbalance on the running time. For the graphs used in our experiments, load balancing schemes result in little improvement in running times. Our implementations on sparse graphs with 64,000 vertices on Thinking Machine's CM-5 achieve a speedup factor of about 4 on 16 processors. On this environment, packaging of messages turns out to be the most effective way to reduce communication costs.
Date of Conference: 15-19 April 1996
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-8186-7255-2
References is not available for this document.
Select All
1.
A. Alexandrov, M. F. lonescu, K. E. Schauser and C. Scheiman, "LogGP: Incorporating long messages into the LogP model", Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995.
2.
R. J. Anderson and G. L. Miller, "Deterministic parallel list ranking", Algorithmic/!, vol. 6, pp. 859-868, 1991.
3.
R. S. Barr, R. V. Helgaon and I L. Kennington, "Minimal spanning trees: An empirical investigation of parallel algorithms", Parallel Computing, vol. 12, no. 1, pp. 45-52, October 1989.
4.
O. Boriivka, "O jistem problemu minimalnim", Prdce Mor. Prirodoved. Spol. v Brrw (Acta Societ. Scient. Nairn: Moravicae), vol. 3, pp. 37-58, 1926.
5.
S. Chung and A. Condon, Parallel implementation of Boruvkas minimum spanning tree algorithm, 1996.
6.
R. Cole and U. Vishkin, "Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time", SIAM J. Computing, vol. 17, no. 1, pp. 128-142, 1988.
7.
D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, et al., "LogP: Towards a realistic model of parallel computation", 4th ACM SIGPIAN Symposium on Principles and Practices of Parallel Programming, 1993.
8.
R. L. Graham and P. Hell, "On the history of the minimum spanning tree problem", Annals of the History of Computing, vol. 7, no. l, pp. 43-57, 1985.
9.
S. L. Johnsson, "The Connection Machine systems CM-5", Proc. 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 365-366, 1993-June.
10.
D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorical Computing, NY, New York:ACM Press, 1993.
11.
B. M. E. Moret and H. D. Shapiro, "An empirical assessment of algorithms for constructing a minimum spanning tree" in DlMACS Series in Discrete Mathematics and Theoretical Computer Science, RI, Providence:American Mathematical Society, vol. 15, pp. 99-117, 1994.
12.
D. Roweth, "The Meiko CS-2 system architecture", Proc. 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 213, 1993-June.
13.
W. Oed and M. Walker, "An overview of Cray research computers", Proc. 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 271-272, 1993-June.
14.
M. Snir, Issues and directions in scalable parallel computing, 1993.
15.
U. Vishkin, "Randomized speed-ups in parallel computation", Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 230-239, 1984.
