This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n7http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F05%3APU56439%21RIV10-GA0-26230___/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F05%3APU56439%21RIV10-GA0-26230___
rdf:type
skos:Concept n18:Vysledek
dcterms:description
As chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of optimization. Group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific Bayesian Optimization Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic Simulated Annealing) to design optimal communication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The group communication schedules were designed for an asymmetrical AMP network on one hand and for the benchmark hypercube network on the other, using SF (Store-and-Forward) and WH (Wormhole) switching. As chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of optimization. Group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific Bayesian Optimization Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic Simulated Annealing) to design optimal communication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The group communication schedules were designed for an asymmetrical AMP network on one hand and for the benchmark hypercube network on the other, using SF (Store-and-Forward) and WH (Wormhole) switching.
dcterms:title
Evolutionary Design of Group Communication Schedules for Interconnection Networks Evolutionary Design of Group Communication Schedules for Interconnection Networks
skos:prefLabel
Evolutionary Design of Group Communication Schedules for Interconnection Networks Evolutionary Design of Group Communication Schedules for Interconnection Networks
skos:notation
RIV/00216305:26230/05:PU56439!RIV10-GA0-26230___
n4:aktivita
n10:P
n4:aktivity
P(GA102/05/0467)
n4:dodaniDat
n11:2010
n4:domaciTvurceVysledku
n8:9380922 n8:4415329 n8:2457652
n4:druhVysledku
n6:D
n4:duvernostUdaju
n16:S
n4:entitaPredkladatele
n15:predkladatel
n4:idSjednocenehoVysledku
520831
n4:idVysledku
RIV/00216305:26230/05:PU56439
n4:jazykVysledku
n20:eng
n4:klicovaSlova
Genetic algorithms, collective communications
n4:klicoveSlovo
n17:Genetic%20algorithms n17:collective%20communications
n4:kontrolniKodProRIV
[BBBB7508DEFD]
n4:mistoKonaniAkce
Istanbul
n4:mistoVydani
Berlin
n4:nazevZdroje
Proceedings of the 20th International Symposium Computer and Information Sciences - ISCIS 2005
n4:obor
n13:JC
n4:pocetDomacichTvurcuVysledku
3
n4:pocetTvurcuVysledku
3
n4:projekt
n9:GA102%2F05%2F0467
n4:rokUplatneniVysledku
n11:2005
n4:tvurceVysledku
Jaroš, Jiří Ohlídal, Miloš Dvořák, Václav
n4:typAkce
n21:WRD
n4:zahajeniAkce
2005-10-26+02:00
s:numberOfPages
10
n7:hasPublisher
Springer-Verlag
n19:isbn
978-3-540-29414-6
n12:organizacniJednotka
26230