About: Complexity of Collective Communications on NoCs     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
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
  • 127-132
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/05/0467)
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
  • 469408
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
  • [BF471F137B6C]
http://linked.open...v/mistoKonaniAkce
  • Bialystok
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
  • IEEE Computer Society
https://schema.org/isbn
  • 0-7695-2554-7
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software