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|
|Number of pages||5|
|State||Published - 2011|