This Article 
 Bibliographic References 
 Add to: 
Parallel Sorting in a Ring Network of Processors
March 1989 (vol. 38 no. 3)
pp. 458-464
A parallel implementation of selection sorting algorithms is presented that uses a ring-connected array of processors, in which each processor has the same amount of memory. The scheme allows all processors to have the same amount of memory with a small fragmentation loss. Uniformity in the size of the memories provides advantages from the viewpoint of manufacture, maintenance, inventory, item

[1] P. N. Armstrong, U.S. Patent 4 131 947, Dec. 26, 1978.
[2] D. Bitton, D. J. Dewitt, D. K. Hsiao, and J. Menon, "A taxonomy of parallel sorting,"Comput. Surveys, vol. 16, pp. 287-318, 1984.
[3] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[4] Y. Tanaka, Y. Nozaka, and A. Masuyama, "Pipeline searching and sorting modules as components of dataflow database computer," inProc. Int. Fed. Inform. Processing, Oct. 1980, pp. 427-432.
[5] J. W. J. Williams, "Heapsort,"Commun. ACM, vol. 7, pp. 347- 348, 1964.

Index Terms:
parallel sorting; ring network of processors; parallel implementation; selection sorting algorithms; ring-connected array; manufacture; maintenance; inventory; item placement; performance improvement; carry-look-ahead techniques; computer networks; sorting.
Y.-C. Hong, T.H. Payne, "Parallel Sorting in a Ring Network of Processors," IEEE Transactions on Computers, vol. 38, no. 3, pp. 458-464, March 1989, doi:10.1109/12.21133
Usage of this product signifies your acceptance of the Terms of Use.