Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
JAROŠ, J.; OHLÍDAL, M.; DVOŘÁK, V.
Originální název
Complexity of Collective Communications on NoCs
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
The paper addresses the important issue related to communication performance of Networks on Chip (NoCs), namely the complexity of collective communications measured by a required number of algorithmic steps. Three NoC topologies are investigated, a ring network, Octagon and 2D-mesh, due to their easy manufacturability on a chip. The lower complexity bounds are compared to real values obtained by evolution-based optimizing tools. Results give hints on what communication overhead is to be expected in ring- and mesh-based NoCs with the wormhole switching, full duplex links and k-port non-combining nodes.
Anglický abstrakt
Klíčová slova
Collective communications, networks on chips, evolutionary design, ring, mesh, octagon
Klíčová slova v angličtině
Autoři
Vydáno
14.09.2006
Nakladatel
IEEE Computer Society
Místo
Los Alamitos, CA 90720-1314
ISBN
0-7695-2554-7
Kniha
Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering
Strany od
127
Strany do
132
Strany počet
6
URL
http://www.fit.vutbr.cz/~jarosjir/pubs/Parelec06.pdf
BibTex
@inproceedings{BUT22272, author="Jiří {Jaroš} and Miloš {Ohlídal} and Václav {Dvořák}", title="Complexity of Collective Communications on NoCs", booktitle="Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering", year="2006", pages="127--132", publisher="IEEE Computer Society", address="Los Alamitos, CA 90720-1314", isbn="0-7695-2554-7", url="http://www.fit.vutbr.cz/~jarosjir/pubs/Parelec06.pdf" }