Communication-efficient bitonic sort on a distributed memory parallel computer

Yong Cheol Kim, Minsoo Jeon, Dongseung Kim, Andrew Sohn

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized, however, a great portion of execution time is consumed due to O(log2P) time of data exchange of N/P keys where P, N are the number of processors and keys, respectively. This paper presents an efficient way of data communication in bitonic sort to minimize the interprocessor communication and computation time. Before actual data movement, each pair processors exchange the minimum and maximum in its list of keys to determine what keys are to be sent to its partner. Very often no keys need to exchange, or only a fraction of them are exchanged. At least 20% or greater of execution time could be reduced on T3E computer in our experiments. We believe the scheme is a good way to shorten the communication time in similar applications.

Original languageEnglish (US)
Pages (from-to)165-170
Number of pages6
JournalProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
StatePublished - 2001

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture


Dive into the research topics of 'Communication-efficient bitonic sort on a distributed memory parallel computer'. Together they form a unique fingerprint.

Cite this