About: Design of Group Communication for Regular and Irregular Networks     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
  • 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.
  • 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. (en)
  • 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. (cs)
Title
  • Design of Group Communication for Regular and Irregular Networks
  • Návrh skupinových komunikací pro pravidelné a nepravidelné sítě (cs)
  • Design of Group Communication for Regular and Irregular Networks (en)
skos:prefLabel
  • Design of Group Communication for Regular and Irregular Networks
  • Návrh skupinových komunikací pro pravidelné a nepravidelné sítě (cs)
  • Design of Group Communication for Regular and Irregular Networks (en)
skos:notation
  • RIV/00216305:26230/05:PU56427!RIV06-GA0-26230___
http://linked.open.../vavai/riv/strany
  • 45-50
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/02/0503)
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
  • 517395
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/05:PU56427
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • group communications, hybrid parallel genetic simulated annealing, communication architectures, parallel processing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [DB6DB1C133DA]
http://linked.open...v/mistoKonaniAkce
  • FME, VUT BRNO
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Mendel 2005 11th Internacional Conference on Soft Computing
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
  • Schwarz, Josef
  • Ohlídal, Miloš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoké učení technické v Brně. Fakulta strojního inženýrství
https://schema.org/isbn
  • 80-214-2961-5
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, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software