Genetic Search for the Shortest Group Communications on Irregular Topologies

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F03%3APU42600" target="_blank" >RIV/00216305:26230/03:PU42600 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Genetic Search for the Shortest Group Communications on Irregular Topologies

Original language description

This paper presents design and experimental results of a parallel algorithm GAroute. Its purpose is to make up a routing schedule for efficient transmission of messages in a distributed computer system during group communications. The goal is to performa particular communication in the shortest possible number of steps. Application of GAroute is especially advantageous for communication networks with irregular topologies, where routing tables are mostly used. Accuracy of results obtained with the algorrithm is demonstrated on a regular topology with known lower bounds of communication complexity.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F02%2F0503" target="_blank" >GA102/02/0503: Parallel performance prediction and tuning</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of XXVth International Autumn Colloquium ASIS 2003

ISBN

80-85988-88-7

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

321-326

Publisher name

NEUVEDEN

Place of publication

Ostrava

Event location

Sv. Hostýn

Event date

Sep 8, 2003

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—