Skip to main content
Log in

Practical parallel Union-Find algorithms for transitive closure and clustering

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Practical parallel algorithms, based on classical sequential Union-Find algorithms for computing transitive closures of binary relations, are described and implemented for both shared memory and distributed memory parallel computers. By practical algorithms, we mean algorithms that are efficient for parallel systems with bounded numbers of processors as opposed to algorithms where the number of processors grows with the problem size. Transitive closures are useful for decomposing many applications problems into independent subproblems. The implementations were on an ENCORE Multimax shared memory machine and an NCUBE hypercube. Our implementations indicate that transitive closure computations are intrinsically difficult for distributed memory parallel machines because of the need for global information. By contrast, our results for shared memory machines exhibited excellent speedups.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. L. Gustafson, G. R. Montry, and R. E. Benner, Development of parallel methods for a 1024-processor hypercube.SIAM Journal on Scient. and Statist. Computing, Vol. 9, 1988.

  2. J. A. George and J. W. Liu,Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, New Jersey (1981).

    Google Scholar 

  3. T. G. Allen, G. Cybenko, C. Angelli, and J. Polito, Hypercube implementation of tracking algorithms. InProceedings of JDL Workshop on Command and Control, p. 145–153, Washington, DC (1987).

  4. T. G. Allen, G. Cybenko, C. M. Angelli, and J. Polito,Parallel processing for multitarget surveillance and tracking, Technical Report TR-360, ALPHATECH, Inc., Burlington, Massachusetts (1988).

    Google Scholar 

  5. G. Cybenko and T. G. Allen, Parallel algorithms for clustering and classification. InProceedings of SPIE Conference on Advanced Architectures and Algorithms for Signal Processing, p. 126–132, San Diego, California (1987).

  6. P. Duda and R. Heart,Pattern Classification and Scene Analysis. J. Wiley and Sons, New York (1973).

    Google Scholar 

  7. G. S. Almasi and A. Gottlieb,Highly Parallel Computing, Benjamin/Cummings, Redwood City, California (1988).

    Google Scholar 

  8. M. J. Quinn,Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York (1987).

    Google Scholar 

  9. A. Borodin, S. A. Cook, and N. Pippenger, Parallel computation for well-endowed rings and space-bounded probabilsstic machines.Inf. and Control, p. 1–3:113–136 (1983).

  10. F. Y. Chin, J. Lam, and I. Chen, Efficient parallel algorithms for some graph problems,Communications of ACM, p. 649–655 (1982).

  11. V. Pan and J. Reif,Fast and efficient solution of path algebra problems, Technical Report TR.87.3, SUNY Albany, Department of Computer Science (1987).

  12. J. D. Ullman,Computational Aspects of VLSI, Computer Science Press, Rockvill, Maryland (1984).

    Google Scholar 

  13. U. Vishkin, An optimal parallel connectivity algorithm,Discrete Applied Mathematics 9:197–207 (1984).

    Google Scholar 

  14. R. Agrawal and H. V. Jagadish, Multiprocessor transitive closure algorithms, InProc. of Int. Symp. on Databases in Parallel and Distributed Systems, IEEE Computer Society, Austin, Texas (August 1988).

  15. P. Valduriez and S. Khoshefian, Parallel evaluation of the transitive closure of a database relation,Int. Journal of Parallel Programming, Vol. 17 (1988).

  16. R. E. Tarjan and J. Van Leeuwen, Worst-case analysis of set union algorithmsJour. of Assoc. for Comput. Machin., p. 245–281 (1984).

  17. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974).

    Google Scholar 

  18. R. Sedgewick,Algorithms, Addison-Wesley, Reading, Massachusetts (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by NSF Grant DCR-8619103, ONR contract N000-86-G-0202 and DOE Grant DE-FG02-85ER25001.

Supported in part by RADC contract F30602-85-C-0303.

Supported in part by RADC contract F30602-85-C-0303.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cybenko, G., Allen, T.G. & Polito, J.E. Practical parallel Union-Find algorithms for transitive closure and clustering. Int J Parallel Prog 17, 403–423 (1988). https://doi.org/10.1007/BF01383882

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01383882

Key Words

Navigation