Publication Details

On Complexity of Collective Communications on a Fat Cube Topology

KUTÁLEK, V.; DVOŘÁK, V. On Complexity of Collective Communications on a Fat Cube Topology. Journal of Universal Computer Science, 2005, vol. 11, no. 6, p. 944-961. ISSN: 0948-6968.

Czech title

Složitost skupinových komunikací na tlusté krychli

Type

journal article

Language

English

Authors

Kutálek Vladimír, Ing., Ph.D.
Dvořák Václav, prof. Ing., DrSc.

Keywords

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

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.

Published

2005

Pages

944–961

Journal

Journal of Universal Computer Science, vol. 11, no. 6, ISSN 0948-6968

BibTeX

@article{BUT42910,
  author="Vladimír {Kutálek} and Václav {Dvořák}",
  title="On Complexity of Collective Communications on a Fat Cube Topology",
  journal="Journal of Universal Computer Science",
  year="2005",
  volume="11",
  number="6",
  pages="944--961",
  issn="0948-6968"
}