Publication detail

On Complexity of Collective Communications on a Fat Cube Topology

KUTÁLEK, V., DVOŘÁK, V.

Original Title

On Complexity of Collective Communications on a Fat Cube Topology

English Title

On Complexity of Collective Communications on a Fat Cube Topology

Type

journal article - other

Language

en

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

English 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

Interconnection networks, fat cube topology, router architecture, collective communications

RIV year

2005

Released

26.08.2005

Pages from

944

Pages to

961

Pages count

18

BibTex


@article{BUT42910,
  author="Vladimír {Kutálek} and Václav {Dvořák}",
  title="On Complexity of Collective Communications on a Fat Cube Topology",
  annote="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.",
  chapter="42910",
  journal="Journal of Universal Computer Science",
  number="6",
  volume="11",
  year="2005",
  month="august",
  pages="944--961",
  type="journal article - other"
}