Attributes | Values |
---|
rdf:type
| |
Description
| - 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.
- 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. (en)
- Tento článek se zabývá časovou složitostí kolektivních komunikací v sítích na čipu. Z důvodu snadné výroby byly zavedeny tři síťové topologie, kruhová síť, octagon a 2D-mřížka. Jejich teoreticky odvozené dolní meze časových složitostí pro jednotlivé komunikační vzory byly porovnány s výsledky dosaženými pomocí technik evolučního návrhu. Dosažené výsledky ukazují jakou komunikační režii lze předpokládat na jednotlivých topologiích při použití červího směrování, plně duplexních linek a k-portového nekombinujícího modelu. (cs)
|
Title
| - Complexity of Collective Communications on NoCs
- Complexity of Collective Communications on NoCs (en)
- Složitost skupinových komunikací v NoCs (cs)
|
skos:prefLabel
| - Complexity of Collective Communications on NoCs
- Complexity of Collective Communications on NoCs (en)
- Složitost skupinových komunikací v NoCs (cs)
|
skos:notation
| - RIV/00216305:26230/06:PU66976!RIV07-GA0-26230___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/06:PU66976
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Collective communications, networks on chips, evolutionary design, ring, mesh, octagon (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| - Los Alamitos, CA 90720-1314
|
http://linked.open...i/riv/nazevZdroje
| - Proc. of 5th International Symposium on Parallel Computing in Electrical Engineering
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Dvořák, Václav
- Jaroš, Jiří
- Ohlídal, Miloš
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |