MESH-CONNECTED COMPUTERS WITH FIXED AND RECONFIGURABLE BUSES - PACKETROUTING AND SORTING

Mesh connected computers have become attractive models of computing be cause 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 mes h with reconfigurable buses. Both these models have been the subject m atter of extensive previous research. We solve numerous important prob lems related to packet routing and sorting on these models. In particu lar, we provide lower bounds and very nearly matching upper bounds for the following problems on both these models: 1) Routing on a linear a rray; and 2) k - k routing and k - k sorting on a 2D mesh for any k gr eater than or equal to 12. We provide an improved algorithm for 1 - 1 routing and a matching sorting algorithm. In addition we present greed y algorithms for 1 - 1 routing, k - k routing, and k - k sorting that are better on average and supply matching lower bounds. We also show t hat sorting can be performed in logarithmic time on a mesh with fixed buses. Most of our algorithms have considerably better time bounds tha n known algorithms for the same problems.