Routing with Locality on Meshes with Buses

Routing with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value,d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requires at least a routing time ofdsteps. To do better than this, we propose adding a kind of short bus to ordinary meshes. By using a technique which we call iterative walk-and-ride, we show how the routing time can be reduced by approximately one-third for solving the problem (including the multipacket version) on one- and two-dimensional short-bus meshes. The bounds we develop are tight.

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

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

[3]  Fillia Makedon,et al.  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.

[4]  Marina C. Chen,et al.  A Design Methodology for Synthesizing Parallel Algorithms and Architectures , 1986, J. Parallel Distributed Comput..

[5]  Michael Kaufmann,et al.  Shorter Queues for Permutation Routing on Meshes , 1994, MFCS.

[6]  Steven. Cheung,et al.  Packet routing on mesh-connected computers , 1992 .

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

[8]  Torsten Suel.  Permutation Routing and Sorting on Meshes with Row and Column Buses , 1995, Parallel Process. Lett..

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

[10]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

[11]  Jun Gu,et al.  Two Packet Routing Algorithms on a Mesh-Connected Computer , 1995, IEEE Trans. Parallel Distributed Syst..

[12]  Manfred Kunde.  Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[13]  Amotz Bar-Noy,et al.  Square meshes are not always optimal , 1989, SPAA '89.

[14]  Sanguthevar Rajasekaran,et al.  Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection , 1993, ESA.

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

[16]  Yen-Wen Lu,et al.  Permutation on the mesh with reconfigurable bus: algorithms and practical considerations , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

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

[18]  Rajeev Raman,et al.  Randomized Routing on Meshes with Buses , 1993, ESA.

[19]  Manfred Kunde,et al.  (k-k) Routing on Multidimensional Mesh-Connected Arrays , 1991, J. Parallel Distributed Comput..

[20]  Ulrich Meyer,et al.  Towards practical permutation routing on meshes , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

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

[22]  Joseph Y.-T. Leung,et al.  On Multidimensional Packet Routing for Meshes with Buses , 1994, J. Parallel Distributed Comput..

[23]  Michael Kaufmann,et al.  Optimal Multi-Packet Routing on the Torus , 1992, SWAT.

[24]  Michael Kaufmann,et al.  Derandomizing algorithms for routing and sorting on meshes , 1994, SODA '94.

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

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

[27]  Francis C. M. Lau,et al.  Mesh Permutation Routing with Locality , 1992, Inf. Process. Lett..

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

[29]  Behrooz Parhami,et al.  Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses , 1993, IEEE Trans. Parallel Distributed Syst..

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

[31]  Francis C. M. Lau,et al.  A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes , 1993, Inf. Process. Lett..

[32]  Kuo-Liang Chung.  Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses , 1995, IEEE Trans. Parallel Distributed Syst..