The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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 and sorting 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) <it>k</it>−<it>k</it> routing and <it>k</it>−<it>k</it> sorting on a 2D mesh for any <it>k</it>≥ 12. We provide an improved algorithm for 1 − 1 routing and a matching sorting algorithm. In addition we present greedy algorithms for 1 − 1 routing, <it>k</it>−<it>k</it> routing, and <it>k</it>−<it>k</it> 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. Most of our algorithms have considerably better time bounds than known algorithms for the same problems.</p>
Reconfigurable networks, mesh, mesh with reconfigurable buses, mesh with fixed buses, sorting, packet routing, k−k routing, k−k sorting, randomized algorithms, parallel computing.
Sanguthevar Rajasekaran, "Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting", IEEE Transactions on Computers, vol. 45, no. , pp. 529-539, May 1996, doi:10.1109/12.509905
88 ms
(Ver 3.3 (11022016))