Scheduling Collective Communications on Wormhole Fat Cubes

V. Dvorak
17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05)  
A recent renewed interest in hypercube interconnection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost,
more » ... rovide lower cost, better scalability and manufacturability without compromising communication performance.
doi:10.1109/cahpc.2005.39 dblp:conf/sbac-pad/Dvorak05 fatcat:j3qawlt6wfcnfoty2jplamr5ee