Performance evaluation of efficient parallel sorting algorithm for supercomputer

A.W.S. LOO, R.W.M. YIP, C.-W. CHUNG

Research output: Book Chapters | Papers in Conference ProceedingsBook ChapterResearchpeer-review

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 languageEnglish
Title of host publicationApplications of supercomputers in engineering III
EditorsC. A. BREBBIA, H. POWER
Place of PublicationUnited Kingdom
PublisherElsevier Science Publishers
Pages111-120
Number of pages10
ISBN (Print)9781853122361
DOIs
Publication statusPublished - 1993

Fingerprint Dive into the research topics of 'Performance evaluation of efficient parallel sorting algorithm for supercomputer'. Together they form a unique fingerprint.

Cite this