Result Details
Scheduling Collective Communications on Wormhole Fat Cubes
DVOŘÁK, V. Scheduling Collective Communications on Wormhole Fat Cubes. Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing. Los Alamitos: IEEE Computer Society, 2005. p. 27-34. ISBN: 0-7695-2446-X.
Type
conference paper
Language
English
Authors
Dvořák Václav, prof. Ing., DrSc., DCSY (FIT)
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
Published
2005
Pages
27–34
Proceedings
Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing
Conference
17th International Symposium on Computer Architecture and High Performance Computing
ISBN
0-7695-2446-X
Publisher
IEEE Computer Society
Place
Los Alamitos
BibTeX
@inproceedings{BUT21526,
author="Václav {Dvořák}",
title="Scheduling Collective Communications on Wormhole Fat Cubes",
booktitle="Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing",
year="2005",
pages="27--34",
publisher="IEEE Computer Society",
address="Los Alamitos",
isbn="0-7695-2446-X"
}
Projects
Architectures of Embedded Systems Networks, GACR, Standardní projekty, GA102/05/0467, start: 2005-01-01, end: 2007-12-31, completed
Research groups
Departments