Publication Details

On Complexity of Collective Communications on a Fat Cube Topology

KUTÁLEK Vladimír and DVOŘÁK Václav. On Complexity of Collective Communications on a Fat Cube Topology. Journal of Universal Computer Science, vol. 11, no. 6, 2005, pp. 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. (DCSY FIT BUT)
Dvořák Václav, prof. Ing., DrSc. (DCSY FIT BUT)
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
Publisher
Springer Verlag
BibTeX 
@ARTICLE{FITPUB7831,
   author = "Vladim\'{i}r Kut\'{a}lek and V\'{a}clav Dvo\v{r}\'{a}k",
   title = "On Complexity of Collective Communications on a Fat Cube Topology",
   pages = "944--961",
   journal = "Journal of Universal Computer Science",
   volume = 11,
   number = 6,
   year = 2005,
   ISSN = "0948-6968",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7831"
}
Back to top