LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
The connection machine systems CM-5
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
The Meiko CS-2 system architecture
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An overview of Cray research computers including the Y-MP/C90 and the new MPP T3D
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Randomized speed-ups in parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
Fast minimum spanning tree for large graphs on the GPU
Proceedings of the Conference on High Performance Graphics 2009
Parallel programming with object assemblies
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Scalable parallel minimum spanning forest computation
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
kNN-Borůvka-GPU: a fast and scalable MST construction from kNN graphs on GPU
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Fast and memory-efficient minimum spanning tree on the GPU
International Journal of Computational Science and Engineering
Scalable parallel OPTICS data clustering using graph algorithmic techniques
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of Boruvka. 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.