The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1978 vol.27)
pp: 669-673
F.P. Preparata , Coordinated Science Laboratory, Department of Electrical Engineering and the Department of Computer Science, University of Illinois
ABSTRACT
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
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool