This paper presents a parallel sorting algorithm (introduced in [LoYi91]) that makes use of the statistical properties of the elements to be sorted. Experiments are run on a MIMD computer. The results suggest that the new algorithm out-performs the parallel quicksort. Similar findings are obtained from a prior study using simulation.
|Title of host publication||Applications of supercomputers in engineering III|
|Editors||C. A. BREBBIA, H. POWER|
|Place of Publication||United Kingdom|
|Publisher||Elsevier Science Publishers|
|Number of pages||10|
|Publication status||Published - 1993|