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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU76796%21RIV10-MSM-26230___
rdf:type
n12:Vysledek skos:Concept
dcterms:description
This work describes the application of a hybrid evolutionary algorithm to scheduling collective communications on the interconnection networks of parallel computers. To avoid contention for links and associated delays, collective communications proceed in synchronized steps. The minimum number of steps is sought for any given network topology, store-and-forward switching, minimum routing and given sets of sender and/or receiver nodes. Used algorithm is able not only to re-invent optimum schedules for known symmetric topologies such as hyper-cubes, but it can find schedules even for  asymmetric or irregular topologies in case of general many-to-many collective communications. In most cases the number of steps reaches the theoretical lower bound for the given type of collective communication; if it does not, non-minimum routing can provide further improvement. Optimum schedules are destined for writing high-performance communication routines for application-specific networks on chip or communicatio This work describes the application of a hybrid evolutionary algorithm to scheduling collective communications on the interconnection networks of parallel computers. To avoid contention for links and associated delays, collective communications proceed in synchronized steps. The minimum number of steps is sought for any given network topology, store-and-forward switching, minimum routing and given sets of sender and/or receiver nodes. Used algorithm is able not only to re-invent optimum schedules for known symmetric topologies such as hyper-cubes, but it can find schedules even for  asymmetric or irregular topologies in case of general many-to-many collective communications. In most cases the number of steps reaches the theoretical lower bound for the given type of collective communication; if it does not, non-minimum routing can provide further improvement. Optimum schedules are destined for writing high-performance communication routines for application-specific networks on chip or communicatio
dcterms:title
Evolutionary design of collective communication based on prediction of conflicts in interconnection networks Evolutionary design of collective communication based on prediction of conflicts in interconnection networks
skos:prefLabel
Evolutionary design of collective communication based on prediction of conflicts in interconnection networks Evolutionary design of collective communication based on prediction of conflicts in interconnection networks
skos:notation
RIV/00216305:26230/08:PU76796!RIV10-MSM-26230___
n4:aktivita
n17:Z
n4:aktivity
Z(MSM0021630528)
n4:dodaniDat
n20:2010
n4:domaciTvurceVysledku
n19:4415329
n4:druhVysledku
n7:B
n4:duvernostUdaju
n16:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
366953
n4:idVysledku
RIV/00216305:26230/08:PU76796
n4:jazykVysledku
n10:eng
n4:klicovaSlova
collective communications, evolutionary optimization, interconnection network, multiprocessor
n4:klicoveSlovo
n8:multiprocessor n8:interconnection%20network n8:collective%20communications n8:evolutionary%20optimization
n4:kontrolniKodProRIV
[25A1528866CC]
n4:mistoVydani
Brno
n4:nazevEdiceCisloSvazku
NEUVEDEN
n4:nazevZdroje
Evolutionary design of collective communication based on prediction of conflicts in interconnection networks
n4:obor
n14:JC
n4:pocetDomacichTvurcuVysledku
1
n4:pocetStranKnihy
145
n4:pocetTvurcuVysledku
1
n4:rokUplatneniVysledku
n20:2008
n4:tvurceVysledku
Ohlídal, Miloš
n4:zamer
n18:MSM0021630528
s:numberOfPages
145
n6:hasPublisher
Vysoké učení technické v Brně. Fakulta informačních technologií
n15:isbn
978-80-214-3597-1
n9:organizacniJednotka
26230