论文信息 - An optimal sorting algorithm for mesh connected computers

An optimal sorting algorithm for mesh connected computers

In this paper we prove a 3n upper and lower bound on the complexity of sorting on a n × n mesh connected parallel computer, and describe an exceptionally simple algorithm which sorts the array by alternately sorting its rows and columns log log n times.

Adi Shamir | Claus-Peter Schnorr | A. Shamir | C. Schnorr

[1] 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.

[2] Adi Shamir,et al. Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks , 1986, ICPP.

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

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

[5] Franco P. Preparata,et al. A Minimum Area VLSI Network for O(log n) Time Sorting , 1985, IEEE Transactions on Computers.

[6] Hartmut Schmeck,et al. Systolic Sorting on a Mesh-Connected Network , 1985, IEEE Transactions on Computers.

[7] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.

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