Efficient Bitonic Communication for the Parallel Data Exchange

Ralf-Peter Mundani; Ernst Rank

Efficient Bitonic Communication for the Parallel Data Exchange

Ralf-Peter Mundani, Ernst Rank

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	World Congress on Engineering and Computer Science (WCECS 2011)
Publisher	International Association of Engineers
Pages	1027-1031
Number of pages	5
State	Published - 2011
Externally published	Yes

Cite this

@inproceedings{92c2886ccf084140bf24ded7f19a5534,

title = "Efficient Bitonic Communication for the Parallel Data Exchange",

abstract = "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.",

author = "Ralf-Peter Mundani and Ernst Rank",

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.",

year = "2011",

language = "English (US)",

pages = "1027--1031",

booktitle = "World Congress on Engineering and Computer Science (WCECS 2011)",

publisher = "International Association of Engineers",

address = "China",

}

TY - GEN

T1 - Efficient Bitonic Communication for the Parallel Data Exchange

AU - Mundani, Ralf-Peter

AU - Rank, Ernst

N1 - 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.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10754/671334

UR - http://www.iaeng.org/publication/WCECS2011/WCECS2011_pp1027-1031.pdf

M3 - Conference contribution

SP - 1027

EP - 1031

BT - World Congress on Engineering and Computer Science (WCECS 2011)

PB - International Association of Engineers

ER -

Efficient Bitonic Communication for the Parallel Data Exchange

Abstract

Other files and links

Fingerprint

Cite this