Scheduling collective communications on wormhole fat cubes

• V. Dvorak Brno University of Technology

Resumo

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, better scalability and manufacturability without compromising communication performance.

Palavras-chave: Network topology, Hypercubes, Scalability, Multiprocessor interconnection networks, Costs, Switches, Computer architecture, Job shop scheduling, Manufacturing, Digital systems