Publication detail

Scheduling Collective Communications on Wormhole Fat Cubes

DVOŘÁK, V.

Original Title

Scheduling Collective Communications on Wormhole Fat Cubes

English Title

Scheduling Collective Communications on Wormhole Fat Cubes

Type

conference paper

Language

en

Original Abstract

A recent renewed interest in hypercube inter-connection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost, better scalability and manufacturability without compro-mising communication performance.

English abstract

A recent renewed interest in hypercube inter-connection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost, better scalability and manufacturability without compro-mising communication performance.

Keywords

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

RIV year

2005

Released

26.08.2005

Publisher

IEEE Computer Society

Location

Los Alamitos

ISBN

0-7695-2446-X

Book

Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing

Pages from

27

Pages to

34

Pages count

9

BibTex


@inproceedings{BUT21526,
  author="Václav {Dvořák}",
  title="Scheduling Collective Communications on Wormhole Fat Cubes",
  annote="A recent renewed interest in hypercube inter-connection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost, better scalability and manufacturability without compro-mising communication performance.",
  address="IEEE Computer Society",
  booktitle="Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing",
  chapter="21526",
  institution="IEEE Computer Society",
  year="2005",
  month="august",
  pages="27--34",
  publisher="IEEE Computer Society",
  type="conference paper"
}