Publication Details

Complexity of Collective Communications on NoCs

JAROŠ, J.; OHLÍDAL, M.; DVOŘÁK, V. Complexity of Collective Communications on NoCs. In Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering. Los Alamitos, CA 90720-1314: IEEE Computer Society, 2006. p. 127-132. ISBN: 0-7695-2554-7.
Czech title
Složitost skupinových komunikací v NoCs
Type
conference paper
Language
English
Authors
Jaroš Jiří, doc. Ing., Ph.D. (DCSY)
Ohlídal Miloš, Ing., Ph.D.
Dvořák Václav, prof. Ing., DrSc.
URL
Keywords

Collective communications, networks on chips, evolutionary design, ring, mesh, octagon

Abstract

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.

Published
2006
Pages
127–132
Proceedings
Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering
ISBN
0-7695-2554-7
Publisher
IEEE Computer Society
Place
Los Alamitos, CA 90720-1314
UT WoS
000241727600021
EID Scopus
2-s2.0-50049135890
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"
}
Back to top