The Community for Technology Leaders
Green Image
<p>We give three new parallel sorting algorithms on a mesh-connected computer withwraparound connections (i.e. a torus). These three algorithms, with the minimum queuesize of 1, sort n/sup 2/ random input data items into a blocked snakelike row major order,a row major order, and a snakelike row major order, in 1.5n+o(n), 2n+o(n), and 2n+o(n)average steps, respectively. These results improve the previous results of 2n+o(n),2.5n+o(n), and 2.5n+o(n), respectively. In addition, we prove that the distance bound non a torus is an average-time lower bound independent of indexing schemes of sortingrandom input data items on it.</p>
Index Termssorting; communication complexity; computational complexity; parallel algorithms;multiprocessor interconnection networks; average time bounds; sorting; mesh-connectedcomputer; parallel sorting algorithms; wraparound connections; queue size; distancebound; indexing schemes; average time complexity; parallel algorithms

Q. Gu and J. Gu, "Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 308-315, 1994.
159 ms
(Ver 3.3 (11022016))