Communication-efficient bitonic sort on a distributed memory parallel computer

Y. C. Kim, M. Jeon, Dong Seung Kim, A. Sohn

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

12 Citations (Scopus)

Abstract

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
Title of host publicationProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Pages165-170
Number of pages6
Publication statusPublished - 2001 Jan 1
Event8th International Conference on Parallel and Distributed Systems - Kyongju, Korea, Republic of
Duration: 2001 Jun 262001 Jun 29

Other

Other8th International Conference on Parallel and Distributed Systems
CountryKorea, Republic of
CityKyongju
Period01/6/2601/6/29

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kim, Y. C., Jeon, M., Kim, D. S., & Sohn, A. (2001). Communication-efficient bitonic sort on a distributed memory parallel computer. In Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS (pp. 165-170)