On Complexity of Collective Communications on a Fat Cube Topology

Vladimir Kutálek

Václav Dvořák

Abstract: A recent renewed interest in hypercube interconnection network has been concentrated to the more scalable version known as a fat cube. The paper introduces several router models for fat nodes and uses them for cost comparison of both the hypercube and fat cube topologies. Analysis of time complexity of collective communications is done next and lower bounds on the number of communication steps are derived. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and described in detail. The performed study shows that a large variety of fat cubes can provide much desired flexibility, trading cost for performance and manufacturability.

Keywords: collective communications, fat cube topology, interconnection networks, router architecture

Categories: H.3.1, H.3.2, H.3.3, H.3.7, H.5.1