Issue No.03 - March (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21133
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
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