Efficient Bitonic Communication for the Parallel Data Exchange

Ralf-Peter Mundani, Ernst Rank

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


Efficient communication is still a severe problem in many parallel codes. Therefore, we will discuss the advantages of bitonic sorting networks for the organisation of data exchange among nodes in a parallel program. Via data flow analysis we will find fixpoints of bitonic sorting networks and see how to exploit those for obtaining correction methods that allow to solve the packet problem with O(log N) steps.
Original languageEnglish (US)
Title of host publicationWorld Congress on Engineering and Computer Science (WCECS 2011)
PublisherInternational Association of Engineers
Number of pages5
StatePublished - 2011
Externally publishedYes

Bibliographical note

KAUST Repository Item: Exported on 2021-09-21
Acknowledgements: This publication is based on work supported by Award No. UK-00020 made by King Abdullah University of Science and Technology (KAUST).
This publication acknowledges KAUST support, but has no KAUST affiliated authors.


Dive into the research topics of 'Efficient Bitonic Communication for the Parallel Data Exchange'. Together they form a unique fingerprint.

Cite this