About: Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs Goto Sponge Distinct Permalink

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

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) have not been discussed in the literature as yet, contrary to pair-wise routing algorithms. The paper investigates complexity of CCs in terms of lower bounds on the number of communication steps at conflict-free scheduling. The considered networks on chip make use of wormhole switching, full duplex links and all-port non-combining nodes. A search for conflict-free scheduling of CCs has been done by means of evolutionary algorithms and the resulting numbers of communication steps have been summarized and compared to lower bounds. Time performance of CCs can be evaluated from the obtained number of steps, the given start-up time and link bandwidth. Performance prediction of applications with CCs among computing nodes of the Spidergon network is thus possible. The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) have not been discussed in the literature as yet, contrary to pair-wise routing algorithms. The paper investigates complexity of CCs in terms of lower bounds on the number of communication steps at conflict-free scheduling. The considered networks on chip make use of wormhole switching, full duplex links and all-port non-combining nodes. A search for conflict-free scheduling of CCs has been done by means of evolutionary algorithms and the resulting numbers of communication steps have been summarized and compared to lower bounds. Time performance of CCs can be evaluated from the obtained number of steps, the given start-up time and link bandwidth. Performance prediction of applications with CCs among computing nodes of the Spidergon network is thus possible. (en)
Title	Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs (en)
skos:prefLabel	Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs (en)
skos:notation	RIV/00216305:26230/10:PU89560!RIV12-GA0-26230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA102/08/1429), P(GAP103/10/1517), S, Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Jaroš, Jiří Dvořák, Václav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	258058
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/10:PU89560
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Collective communications, communication scheduling, evolutio-nary design, Spidergon, fat topologies, wormhole switching. (en)
http://linked.open.../riv/klicoveSlovo	Spidergon Collective communications communication scheduling evolutio-nary design fat topologies wormhole switching.
http://linked.open...ontrolniKodProRIV	[586A623A80CB]
http://linked.open...v/mistoKonaniAkce	Portland
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Proceedings of 2010 Genetic and Evolutionary Computation Conference
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Safety and security of networked embedded system applications Natural Computing on Unconventional Platforms
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Dvořák, Václav Jaroš, Jiří
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-07-07 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Association for Computing Machinery
https://schema.org/isbn	978-1-4503-0072-8
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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