Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

A two-dimensional mesh of processing elements (PE's) with separable row and column buses (i.e., broadcast mechanisms for rows and columns that can be logically divided into a number of local buses through the use of PE-controlled switches) has been shown to be quite effective for semigroup computation, prefix computation, and a wide class of other computations that do not require excessive communication or data routing. For meshes with separable row/column buses, the authors show how semigroup and prefix computations can be performed with the same asymptotic time complexity without the provision of buses for every row and every column and discuss the VLSI implications of this new architecture. >

[1]  David A. Carlson,et al.  Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses , 1990, J. Parallel Distributed Comput..

[2]  Alok Aggarwal,et al.  Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on Computers.

[3]  Anthony P. Reeves,et al.  Solving Nonuniform Problems on SIMD Computers: Case Study on Region Growing , 1990, J. Parallel Distributed Comput..

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

[5]  David A. Carlson,et al.  Modified Mesh-Connected Parallel Computers , 1988, IEEE Trans. Computers.

[6]  T. Maeba.  Algorithms for finding maximum and selecting median on a processor array with separable global buses , 1989 .

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

[8]  Russ Miller,et al.  Varying Diameter and Problem Size in Mesh-Connected Computers , 1985, ICPP.

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

[10]  Chung-Horng Lung,et al.  Parallel algorithms on a mesh with multiple broadcasting , 1990, Proceedings of the 1990 Symposium on Applied Computing.

[11]  Nicholas Pippenger.  The Complexity of Computations by Networks , 1987, IBM J. Res. Dev..

[12]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..

[13]  Dionysios I. Reisis,et al.  Image Computations on Meshes with Multiple Broadcast , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Peter R. Cappello.  A Mesh Automaton for Solving Dense Linear Systems , 1985, ICPP.

[15]  William J. Dally,et al.  Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks , 1989, IEEE Trans. Computers.

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

[17]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[18]  David Peleg,et al.  Square Meshes are not always Optimal , 1991, IEEE Trans. Computers.

[19]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  R.F. Hobson,et al.  A mesh-like array processor with fully connected rows and columns , 1989, Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.

[21]  Mikhail J. Atallah.  On Multidimensional Arrays of Processors , 1988, IEEE Trans. Computers.

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