Sorting n/sup 2/ numbers on n*n meshes

The authors show that by folding data from an n*n mesh onto an n*(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n*n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures. The technique may also be applied to reconfigurable bus architectures to obtain faster sorting algorithms.<<ETX>>

[1]  Dionysios I. Reisis,et al.  Data Movement Operations and Applications on Reconfigurable VLSI Arrays , 1988, ICPP.

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

[3]  Quentin F. Stout,et al.  Efficient parallel algorithms for intermediate-level vision analysis on the reconfigurable mesh , 1991 .

[4]  Isaac D. Scherson,et al.  Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.

[5]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[6]  Arvin Park,et al.  Improved sorting algorithms for parallel computers , 1987, CSC '87.

[7]  Viktor K. Prasanna,et al.  An optimal sorting algorithm on reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

[8]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

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

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

[11]  Peter F. Corbett,et al.  Sorting in Mesh Connected Multiprocessors , 1992, IEEE Trans. Parallel Distributed Syst..

[12]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

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

[14]  Manoj Kumar,et al.  An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes , 1983, IEEE Transactions on Computers.

[15]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[16]  Arvin Park,et al.  Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers , 1990, J. Parallel Distributed Comput..

[17]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[18]  Yiming Ma,et al.  The distance bound for sorting on mesh-connected processor arrays is tight , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[19]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.