Abstract
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.
Original language | English |
---|---|
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 |
Pages | 111-120 |
Number of pages | 10 |
ISBN (Print) | 9781853122361 |
DOIs | |
Publication status | Published - 1993 |