This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Parallel-Sorting Schemes
July 1978 (vol. 27 no. 7)
pp. 669-673
F.P. Preparata, Coordinated Science Laboratory, Department of Electrical Engineering and the Department of Computer Science, University of Illinois
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration sortings and comprise the following phases: 1) count acquisition: the keys are subdivided into subsets and for each key we determine the number of smaller keys (count) in every subset; 2) rank determination: the rank of a key is the sum of the previously obtained counts;
Index Terms:
sorting, Computational complexity, efficient algorithms, enumeration sorting, merging, parallel computation
Citation:
F.P. Preparata, "New Parallel-Sorting Schemes," IEEE Transactions on Computers, vol. 27, no. 7, pp. 669-673, July 1978, doi:10.1109/TC.1978.1675167
Usage of this product signifies your acceptance of the Terms of Use.