Improving parallel computation with fast integer sorting

Authors:
Ka Wong Chong;Yijie Han;Yoshihide Igarashi;Tak Wah Lam
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong, China;Electronic Data Systems, Inc., Troy, MI;Department of Computer Science, Gunma University, Kiryu, Japan;Department of Computer Science, The University of Hong Kong, Hong Kong, China
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 14
Cited 2

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

IEEE Transactions on Computers
An optimally efficient selection algorithm

Information Processing Letters
Sorting in c log n parallel steps

Combinatorica
Parallel merge sort

SIAM Journal on Computing
A parallel algorithm for computing minimum spanning trees

Journal of Algorithms
Sorting in linear time?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Finding minimum spanning forests in logarithmic time and linear work using random sampling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the parallel time complexity of undirected connectivity and minimum spanning trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems

Communications of the ACM
Computing connected components on parallel computers

Communications of the ACM
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Conservative Algorithms for Parallel and Sequential Integer Sorting

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Optimal deterministic approximate parallel prefix sums and their applications

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

Optimal parallel selection

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel selection

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents results which improve the efficiency of parallel algorithms for computing minimum spanning trees. These results are obtained by mainly applying fast integer sorting. For an input graph with n vertices and m edges our EREW PRAM minimum spanning tree algorithm runs in O(log n) time with O((m + n)√log n) operations. Our CRCW PRAM minimum spanning tree algorithm runs in O(log n) time with O((m + n) log log n) operations. These complexities relate to the complexities of parallel integer sorting. We also show that for dense graphs we can achieve O(log n) time with O(n2) operations on the EREW PRAM.