Solving tree problems on a mesh-connected processor array

In this paper we present techniques that result in O(√n) time algorithms for computing many properties and functions of an n-node forest stored in an √n × √n mesh of processors. Our algorithms include computing simple properties like the depth, the height, the number of descendents, the preorder (resp. postorder, inorder) number of every node, and a solution to the more complex problem of computing the Minimax value of a game tree. Our algorithms are asymptotically optimal since any nontrivial computation will require Ω (√n) time on the mesh. All of our algorithms generalize to higher dimensional meshes.

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

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

[3]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[4]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[5]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[6]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[7]  Susanne E. Hambrusch.  Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes , 1985 .

[8]  Quentin F. Stout.  Tree-Based Graph Algorithms for Some Parallel Computers , 1985, ICPP.

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[10]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[11]  Mikhail J. Atallah,et al.  Graph problems on a mesh-connected processor array (Preliminary Version) , 1982, STOC '82.

[12]  Yung H. Tsin,et al.  Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[13]  Uzi Vishkin,et al.  On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..

[14]  Mikhail J. Atallah,et al.  Parallel Strong Orientation of an Undirected Graph , 1984, Inf. Process. Lett..

[15]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1986, STOC '86.

[16]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.