A comparison based parallel sorting algorithm

Laxmikant V. Kale, Sanjeev Krishnan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a fast comparison based parallel sorting algorithm that can handle arbitrary key types. Data movement is the major portion of sorting time for most algorithms in the literature. Our algorithm is parameterized so that is can be tuned to control data movement time, especially for large data sets. Parallel histograms are used to partition the key set exactly. The algorithm is architecture independent, and has been implemented in the CHARM portable parallel programming system, allowing it to be efficiently run on virtually any MIMD computer. Performance results for sorting different data sets are presented.

Original languageEnglish (US)
Title of host publicationAlgorithms and Applications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages196-200
Number of pages5
ISBN (Electronic)0849389836
DOIs
StatePublished - 1993
Event1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States
Duration: Aug 16 1993Aug 20 1993

Publication series

NameProceedings of the International Conference on Parallel Processing
Volume3
ISSN (Print)0190-3918

Conference

Conference1993 International Conference on Parallel Processing, ICPP 1993
Country/TerritoryUnited States
CitySyracuse
Period8/16/938/20/93

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'A comparison based parallel sorting algorithm'. Together they form a unique fingerprint.

Cite this