COCOON 1999: Computing and Combinatorics pp 452-461 | Cite as

Improving Parallel Computation with Fast Integer Sorting

  • Ka Wong Chong
  • Yijie Han
  • Yoshihide Igarashi
  • Tak Wah Lam
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1627)

Abstract

This paper presents results which improve the e.ciency 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\left( {\left( {m + n} \right)\sqrt {\log n} } \right) \) 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(n 2) operations on the EREW PRAM.

Keywords

Parallel algorithms graph algorithms minimum spanning tree integer sorting PRAM 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajtia, J. Komlós, E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3, pp. 1–19(1983).CrossRefMathSciNetGoogle Scholar
  2. 2.
    A. Andersson, T. Hagerup, S. Nilsson, R. Raman. Sorting in linear time? Proc. 1995 Symposium on Theory of Computing, 427–436(1995).Google Scholar
  3. 3.
    B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Trans. on Computers, C-36, 1258–1263, 1987.CrossRefMathSciNetGoogle Scholar
  4. 4.
    F. Y. Chin, J. Lam and I-N. Chen. Efficient parallel algorithms for some graph problems. Comm. ACM, 25 (1982), pp. 659–665.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    K. W. Chong. Finding minimum spanning trees on the EREW PRAM. Proc. 1996 International Computer Symposium (ICS'96), Taiwan, 1996, pp. 7–14.Google Scholar
  6. 6.
    K. W. Chong, Y. Han, T. W. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. Proc. 1999 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, 225–234(1999).Google Scholar
  7. 7.
    R. Cole. Parallel merge sort. SIAM J. Comput., 17 (1988), pp. 770–785.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Cole. An optimally efficient selection algorithm. Information Processing Letters, 26, 295–299(1987/88).CrossRefMathSciNetGoogle Scholar
  9. 9.
    R. Cole, P. N. Klein, R. E. Tarjan. Finding minimum spanning forests in logarithmic time and linear work using random sampling, SPAA'96, pp. 243–250.Google Scholar
  10. 10.
    T. Goldberg and U. Zwick. Optimal deterministic approxiamate parallel prefix sums and their applications. Proc. 3rd Israel Symposium on Theory and Computing Systems, 220–228(1995).Google Scholar
  11. 11.
    Y. Han, X. Shen. Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. Proc. 1999 Tenth ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, 419–428(1999).Google Scholar
  12. 12.
    Y. Han, X. Shen. Conservative algorithms for parallel and sequential integer sorting. Proc. 1995 International Computing and Combinatorics Conference (COCOON'95), Lecture Notes in Computer Science 959, 324–333 (August, 1995).Google Scholar
  13. 13.
    D. S. Hirshberg, A. K. Chandra and D. V. Sarwate. Computing connected components on parallel computers. Comm. ACM, 22 (1979), pp. 461–464.CrossRefMathSciNetGoogle Scholar
  14. 14.
    D. B. Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. J. of Algorithms, 19, 383–401(1995).MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    C. K. Poon, V. Ramachandran. A randomized linear work EREW PRAM algorithm to find a minimum spanning forest. Proc. 8th Annual International Symposium on Algorithms and Computation, 1997, pp. 212–222.Google Scholar
  16. 16.
    R.E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14, pp. 862–874(1985).MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    C.D. Zaroliagis. Simple and work-e.cient parallel algorithms for the minimum spanning tree problem. Parallel Processing Letters, Vol. 7,No. 1, 25–37(1997).CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ka Wong Chong
    • 1
  • Yijie Han
    • 2
  • Yoshihide Igarashi
    • 3
  • Tak Wah Lam
    • 4
  1. 1.Department of Computer ScienceThe University of Hong KongHong KongChina
  2. 2.Electronic Data Systems, Inc.TroyUSA
  3. 3.Department of Computer ScienceGunma UniversityKiryuJapan
  4. 4.Department of Computer ScienceThe University of Hong KongHong KongChina

Personalised recommendations