Minimum spanning tree on the HMESH architecture

A fast algorithm to compute the minimum spanning tree of a given undirected graph on a hierarchical mesh-connected computer (HMESH) is presented. The time complexity of the algorithm is O(log/sup 2/ n), where n is the number of nodes in the graph. HMESH is a broadcast bus VLSI architecture which consists of n*n processing elements (PEs) in a mesh-connected structure and a hierarchy of broadcast buses in each row and column of the mesh structure such that each broadcast bus is connected to exactly k PE's, where k is a small constant. It is shown that with simple modifications to the algorithm, the MST of an n node graph can be found on a HMESH of size p*p in O(n/p)/sup 2/ log n log p) time. It is also shown how to compute connected components and transitive closure of a given undirected graph in O(log/sup 2/ n) with a few modifications to the algorithm presented for computing the minimum spanning tree.<<ETX>>

[1]  Francis Y. L. Chin,et al.  Efficient parallel algorithms for some graph problems , 1982, CACM.

[2]  Cauligi S. Raghavendra,et al.  HMESH: A VLSI Architecture for Parallel Processing , 1986, CONPAR.

[3]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[4]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Frank Thomson Leighton,et al.  Parallel Computation Using Meshes of Trees , 1983, WG.

[6]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[7]  Mikhail J. Atallah,et al.  Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[8]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[9]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10]  David A. Carlson,et al.  Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers , 1985, ICPP.

[11]  I. V. Ramakrishnan,et al.  An Efficient Connected Components Algorithm on a Mesh-Connected Computer , 1985, ICPP.

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Richard M. Brown,et al.  The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.

[14]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[15]  S. N. Maheshwari,et al.  Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems , 1982, Inf. Process. Lett..

[16]  V. Carl Hamacher,et al.  Machine Complexity Versus Interconnection Complexity in Iterative Arrays , 1971, IEEE Transactions on Computers.

[17]  Quentin F. Stout,et al.  Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.

[18]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[19]  H. T. Kung,et al.  A tree machine for searching problems , 1979 .

[20]  Viktor K. Prasanna,et al.  Array Processor with Multiple Broadcasting , 1985, ISCA.

[21]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[22]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.