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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F05%3APU56427%21RIV06-GA0-26230___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
Communication between non-adjacent processors in regular and irregular interconnection networks mostly relies on routing tables. Because the tables generally cannot be derived by means of an analytical approach, we have focused on the utilization of the hybrid parallel genetic simulated annealing algorithm HGSA [1] to design optimal or sub-optimal routing schedule for a sequence of communication steps (neighbor-to-neighbor transfers) during the group communications. The efficiency of the HGSA algorithm was tested on the regular hypercube topology (with the known complexity of communication) and on the irregular AMP (A Minimum Path) topology. Komunikace mezi nesousedními procesory v pravidelných a nepravidelných propojovacích sítích většinou zaleží na směrovacích tabulkách. Poněvadž tyto tabulky nemohou být odvozeny analyticky, pokusili jsme se pomocí hybridního paralelního genetického simulovaného žíhání HGSA[1] navrhnout optimální nebo sub-optimální směrovací plány skupinových komunikací mezi nesousedními procesory. Efektivita HGSA algoritmu byla otestována na hyperkostce - pravidelné síti (se známým optimálním počtem komunikačníích kroků) a na nepravidelné topologii AMP - A Minimum Path. Communication between non-adjacent processors in regular and irregular interconnection networks mostly relies on routing tables. Because the tables generally cannot be derived by means of an analytical approach, we have focused on the utilization of the hybrid parallel genetic simulated annealing algorithm HGSA [1] to design optimal or sub-optimal routing schedule for a sequence of communication steps (neighbor-to-neighbor transfers) during the group communications. The efficiency of the HGSA algorithm was tested on the regular hypercube topology (with the known complexity of communication) and on the irregular AMP (A Minimum Path) topology.
dcterms:title
Návrh skupinových komunikací pro pravidelné a nepravidelné sítě Design of Group Communication for Regular and Irregular Networks Design of Group Communication for Regular and Irregular Networks
skos:prefLabel
Design of Group Communication for Regular and Irregular Networks Návrh skupinových komunikací pro pravidelné a nepravidelné sítě Design of Group Communication for Regular and Irregular Networks
skos:notation
RIV/00216305:26230/05:PU56427!RIV06-GA0-26230___
n3:strany
45-50
n3:aktivita
n12:P
n3:aktivity
P(GA102/02/0503)
n3:dodaniDat
n13:2006
n3:domaciTvurceVysledku
n10:5444284 n10:4415329
n3:druhVysledku
n5:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
517395
n3:idVysledku
RIV/00216305:26230/05:PU56427
n3:jazykVysledku
n7:eng
n3:klicovaSlova
group communications, hybrid parallel genetic simulated annealing, communication architectures, parallel processing
n3:klicoveSlovo
n9:communication%20architectures n9:hybrid%20parallel%20genetic%20simulated%20annealing n9:parallel%20processing n9:group%20communications
n3:kontrolniKodProRIV
[DB6DB1C133DA]
n3:mistoKonaniAkce
FME, VUT BRNO
n3:mistoVydani
Brno
n3:nazevZdroje
Mendel 2005 11th Internacional Conference on Soft Computing
n3:obor
n16:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n14:GA102%2F02%2F0503
n3:rokUplatneniVysledku
n13:2005
n3:tvurceVysledku
Ohlídal, Miloš Schwarz, Josef
n3:typAkce
n4:WRD
n3:zahajeniAkce
2005-06-15+02:00
s:numberOfPages
6
n6:hasPublisher
Vysoké učení technické v Brně. Fakulta strojního inženýrství
n19:isbn
80-214-2961-5
n15:organizacniJednotka
26230