Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection

Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with fixed buses, and 2) a mesh with reconfigurable buses. Both these models have been the subject matter of extensive previous research. We solve numerous important problems related to packet routing, sorting, and selection on these models. In particular, we provide lower bounds and very nearly matching upper bounds for the following problems on both these models: 1) Routing on a linear array; and 2) k-k routing, k-k sorting, and cut through routing on a 2D mesh for any k≥12. In addition we present greedy algorithms for 1-1 routing, k-k routing, cut through routing, and k-k sorting that are better on average and supply matching lower bounds. We also show that sorting can be performed in logarithmic time on a mesh with fixed buses. As a consequence we present an optimal randomized selection algorithm. Further, we provide a selection algorithm for the mesh with reconfigurable buses whose time bound is significantly better than the existing ones. Most of our algorithms have considerably better time bounds than known algorithms for the same problems.

[1]  Sartaj Sahni,et al.  Sorting n numbers on n*n reconfigurable meshes with buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[2]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[3]  Adi Shamir,et al.  An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

[4]  Quentin F. Stout,et al.  BROADCASTING IN MESH-CONNECTED COMPUTERS. , 1982 .

[5]  Manfred Kunde,et al.  Multi-packet-routing on mesh connected arrays , 1989, SPAA '89.

[6]  Sanguthevar Rajasekaran,et al.  An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks , 1987, FSTTCS.

[7]  Sanguthevar Rajasekaran,et al.  Optimal randomized algorithms for multipacket and cut through routing on the mesh , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[8]  Sanguthevar Rajasekaran,et al.  A Comparison of Meshes With Static Buses and Unidirectional Wrap-Arounds , 1992 .

[9]  Sanguthevar Rajasekaran.  k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh , 1995, J. Algorithms.

[10]  Manfred Kunde.  Concentrated regular data streams on grids: sorting and routing near to the bisection bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Sanguthevar Rajasekaran,et al.  Optimal routing algorithms for mesh-connected processor arrays , 1988, Algorithmica.

[12]  Viktor K. Prasanna,et al.  Permutations on Illiac IV-Type Networks , 1986, IEEE Transactions on Computers.

[13]  Sanguthevar Rajasekaran,et al.  Randomised algorithms for packet routing on the mesh , 1992 .

[14]  Fillia Makedon,et al.  A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

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

[16]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[17]  Christos Kaklamanis,et al.  Randomized sorting and selection on mesh-connected processor arrays (preliminary version) , 1991, SPAA '91.

[18]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

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

[20]  Gen-Huey Chen,et al.  Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..

[21]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[22]  Rüdiger Reischuk.  Probabilistic Parallel Algorithms for Sorting and Selection , 1985, SIAM J. Comput..

[23]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[25]  Stephan Olariu,et al.  Applications of Reconfigurable Meshes to Constant-Time Computations , 1993, Parallel Comput..

[26]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

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

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

[29]  H. T. Kung,et al.  Comprehensive evaluation of a two-dimensional configurable array , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[30]  Frank Thomson Leighton,et al.  Average case analysis of greedy routing algorithms on arrays , 1990, SPAA '90.

[31]  Sanguthevar Rajasekaran,et al.  Derivation of Randomized Sorting and Selection Algorithms , 1993 .

[32]  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..

[33]  Pierre Siron,et al.  A reconfigurable optical interconnection network for highly parallel architecture , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[34]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[35]  Sanguthevar Rajasekaran,et al.  Matching the bisection bound for routing and sorting on the mesh , 1992, SPAA '92.

[36]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[37]  Sanguthevar Rajasekaran,et al.  The light bulb problem , 1995, COLT '89.

[38]  Sanguthevar Rajasekaran,et al.  Constant Queue Routing on a Mesh , 1992, J. Parallel Distributed Comput..

[39]  Viktor K. Prasanna,et al.  An Optimal Sorting Algorithm on Reconfigurable Mesh , 1995, J. Parallel Distributed Comput..

[40]  Quentin F. Stout,et al.  Selection on the reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[41]  Sanguthevar Rajasekaran.  Randomized Parallel Selection , 1990, FSTTCS.

[42]  Viktor K. Prasanna,et al.  A fast algorithm for computing histograms on a reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[43]  Christos Kaklamanis,et al.  Optimal sorting on mesh-connected processor arrays , 1992, SPAA '92.

[44]  Joseph Y.-T. Leung,et al.  Packet routing on square meshes with row and column buses , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.