Detail publikace

On Complexity of Collective Communications on a Fat Cube Topology

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

Originální název

On Complexity of Collective Communications on a Fat Cube Topology

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

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

Rok RIV

2005

Vydáno

26. 8. 2005

ISSN

0948-6968

Periodikum

Journal of Universal Computer Science

Ročník

11

Číslo

6

Stát

Rakouská republika

Strany od

944

Strany do

961

Strany počet

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",
  journal="Journal of Universal Computer Science",
  year="2005",
  volume="11",
  number="6",
  pages="944--961",
  issn="0948-6968"
}