By Topic

Complexity of Collective Communications on NoCs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Jaros, J. ; Brno Univ. of Technol. ; Ohlidal, M. ; Dvorak, V.

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 in:

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Date of Conference:

13-17 Sept. 2006