Detail publikace

Genetic Search for the Shortest Group Communications on Irregular Topologies

DVOŘÁK, V., STAROBA, J.

Originální název

Genetic Search for the Shortest Group Communications on Irregular Topologies

Anglický název

Genetic Search for the Shortest Group Communications on Irregular Topologies

Jazyk

en

Originální abstrakt

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 perform a 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 algorithm is demonstrated on a regular topology with known lower bounds of communication complexity.

Anglický abstrakt

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 perform a 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 algorithm is demonstrated on a regular topology with known lower bounds of communication complexity.

Dokumenty

BibTex


@inproceedings{BUT14203,
  author="Václav {Dvořák} and Jiří {Staroba}",
  title="Genetic Search for the Shortest Group Communications on Irregular Topologies",
  annote="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 perform a 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 algorithm is demonstrated on a regular topology with known lower bounds of communication complexity.",
  booktitle="Proceedings of XXVth International Autumn Colloquium ASIS 2003",
  chapter="14203",
  year="2003",
  month="september",
  pages="321--326",
  type="conference paper"
}