Publication detail

Complexity of Collective Communications on NoCs

JAROŠ, J. OHLÍDAL, M. DVOŘÁK, V.

Original Title

Complexity of Collective Communications on NoCs

English Title

Complexity of Collective Communications on NoCs

Type

conference paper

Language

en

Original 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.

English 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.

Keywords

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

RIV year

2006

Released

14.09.2006

Publisher

IEEE Computer Society

Location

Los Alamitos, CA 90720-1314

ISBN

0-7695-2554-7

Book

Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering

Pages from

127

Pages to

132

Pages count

6

BibTex


@inproceedings{BUT22272,
  author="Jiří {Jaroš} and Miloš {Ohlídal} and Václav {Dvořák}",
  title="Complexity of Collective Communications on NoCs",
  annote="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.",
  address="IEEE Computer Society",
  booktitle="Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering",
  chapter="22272",
  institution="IEEE Computer Society",
  year="2006",
  month="september",
  pages="127--132",
  publisher="IEEE Computer Society",
  type="conference paper"
}