Result Details

Genetic Search for the Shortest Group Communications on Irregular Topologies

DVOŘÁK, V.; STAROBA, J. Genetic Search for the Shortest Group Communications on Irregular Topologies. Proceedings of XXVth International Autumn Colloquium ASIS 2003. Ostrava: Marq software s.r.o., 2003. p. 321-326. ISBN: 80-85988-88-7.
Type
conference paper
Language
English
Authors
Dvořák Václav, prof. Ing., DrSc.
Staroba Jiří, Ing., Ph.D., FIT (FIT)
Abstract

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.

Keywords

group communications, genetic algorithms, communication architectures, parallel algorithms

Published
2003
Pages
321–326
Proceedings
Proceedings of XXVth International Autumn Colloquium ASIS 2003
Conference
ASIS2003 - XXVth International Autumn Colloquium ADVANCED SIMULATION OF SYSTEMS
ISBN
80-85988-88-7
Publisher
Marq software s.r.o.
Place
Ostrava
BibTeX 
@inproceedings{BUT14203,
  author="Václav {Dvořák} and Jiří {Staroba}",
  title="Genetic Search for the Shortest Group Communications on Irregular Topologies",
  booktitle="Proceedings of XXVth International Autumn Colloquium ASIS 2003",
  year="2003",
  pages="321--326",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-85988-88-7"
}
Research groups
Supercomputing Technologies Research Group SC@FIT (RG SC@FIT)
Departments
Faculty of Information Technology (FIT)
Back to top