Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses

The mesh-connected computer with multiple buses (MC-CMB) is a well-known parallel organization, providing broadcast facilities in each row and each column. In this paper, we propose a 2D generalized MCCMB (2-GMCCMB) for the purpose of increasing the efficiency of executing some important applications of prefix computations such as solving Linear recurrences and tridiagonaI systems, etc. A k/sub 1/n/sub 1spl times/k/sub 1/n/sub 2/ 2-GMCCMB is constructed from a k/sub 1/n/sub 1spl times/k/sub 1/n/sub 2/ mesh organization by enhancing the power of each disjoint n/sub 1spl times/n/sub 2/ submesh with multiple buses (sub-2-MCCMB). Given n data, a prefix computation can be performed in O(n/sup 1/10/) time on an n/sup 3/5spl times/n/sup 2/5/ 2-GMCCMB, where each disjoint sub-2-MCCMB is of size n/sup 1/2spl times/n/sup 3/10/. This time bound is faster than the previous time bound of O(n/sup 1/8/) for the same computation on an n/sup 5/8spl times/n/sup 3/8/ 2-MCCMB. Furthermore, the time bound of our parallel prefix algorithm can be further reduced to O(n/sup 1/11/) if fewer processors are used. Our result can be extended to the d-dimensional GMCCMB, giving a time bound of O(n/sup 1/(d2(d)+d)/) for any constant d; here, we omit the constant factors. This time bound is less than the previous time bound of O(n/sup 1/(d2(d))/) on the d-dimensional MCCMB. >

[1]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[2]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[3]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

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

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

[6]  Stephan Olariu,et al.  Selection on rectangular meshes with multiple broadcasting , 1993, BIT Comput. Sci. Sect..

[7]  Harold S. Stone,et al.  Parallel Tridiagonal Equation Solvers , 1975, TOMS.

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

[9]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[10]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[11]  D. Parkinson,et al.  The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[12]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[13]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

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

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

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

[17]  Harold S. Stone,et al.  An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations , 1973, JACM.

[18]  Alok Aggarwal.  Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on 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]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

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

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

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

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

[25]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[26]  Wen-Tsuen Chen,et al.  Efficient Medain Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting , 1992, J. Parallel Distributed Comput..