Detail výsledku
Performance of Collective Communications on Interconnection Networks with Fat Nodes and Edges
Jaroš Jiří, prof. Ing., Ph.D., FIT (FIT), UPSY (FIT)
Dvořák Václav, prof. Ing., DrSc., UPSY (FIT)
The paper deals with scheduling collective communications in the minimum number of communication steps; it shows how to generalize the known results regarding time complexity of collective communications on common direct networks for the same networks with fat nodes and edges. Models of node architecture composed of several processor cores that share a router are discussed. Examples of communication algorithms on fat K-ring networks with 8 to 32 processors are summarized and given in detail. The results show that fat networks, depending on their configuration, can provide a range of communication performance at a lower cost.
Collective communications, fat networks, communication performance, K-ring
@inproceedings{BUT22202,
author="Miloš {Ohlídal} and Jiří {Jaroš} and Václav {Dvořák}",
title="Performance of Collective Communications on Interconnection Networks with Fat Nodes and Edges",
booktitle="Proceedings of the Fifth International Conference on Networking ICN 2006",
year="2006",
pages="619--624",
publisher="IEEE Computer Society",
address="Los Alamitos",
isbn="0-7695-2570-9"
}