Accession Number:

ADA056886

Title:

New Parallel Sorting Schemes.

Personal Author(s):

Corporate Author:

ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB

Report Date:

1977-07-01

Abstract:

This paper describes a family of parallel sorting algorithms for a multiprocessor system. These algorithms are enumeration sorts and comprise the following phases count acquisition the keys are subdivided into subsets and for each key the number of smaller keys count in every subset is determined rank determination the rank of a key is the sum of the previously obtained counts data rearrangement each key is placed in the position specified by its rank. The basic novelty of the algorithms is the use of parallel merging to implement count acquisition.

Descriptive Note:

Technical rept.,

Pages:

0018

Descriptors:

Subject Categories:

Communities Of Interest:

Contract Number:

DAAB07-72-C-0259

Contract Number 2:

NSF-MCS-76-17321

File Size:

7.26MB

View The Document