Practical parallel union-find algorithms for transitive closure and clustering

Journal Article · Sat Oct 01 04:00:00 EDT 1988 · International Journal of Parallel Programming; (USA)

DOI:https://doi.org/10.1007/BF01383882· OSTI ID:6193129

Cybenko, G ^[1]; Allen, T G; Polito, J E ^[2]

---

1. Univ. of Illinois, Urbana (USA)
2. ALPHATECH, Inc., Burlington, MA (USA)

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, the authors 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. Their implementations indicate that transitive closure computations are intrinsically difficult for distributed memory parallel machines because of the need for global information. By contrast, their results for shared memory machines exhibited excellent speedups.

• OSTI ID: 6193129
• Journal Information: International Journal of Parallel Programming; (USA), Journal Name: International Journal of Parallel Programming; (USA) Vol. 17:5; ISSN IJPPE; ISSN 0885-7458
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER NETWORKS
DATA PROCESSING
DATA TRANSMISSION
EFFICIENCY
IMPLEMENTATION
MATHEMATICAL LOGIC
MATHEMATICS
MEMORY DEVICES
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
SET THEORY
TASK SCHEDULING