Publication Details

Design of Low-Cost Communication Algorithms for Irregular Networks

STAROBA Jiří and DVOŘÁK Václav. Design of Low-Cost Communication Algorithms for Irregular Networks. In: Proceedings of the 3rd International Conference on Networking ICN '04. Colmar: University of Haute Alsace, 2004, pp. 980-985. ISBN 0-86341-325-0.
Czech title
Návrh komunikačních algoritmů s nízkou režií pro nepravidelné sítě
Type
conference paper
Language
english
Authors
Keywords

communications, genetic algorithms, communication architectures, parallel processing

Abstract

Communication between non-adjacent nodes in irregular interconnection networks mostly relies on routing tables. Efficient implementation of group communication algorithms such as total exchange also needs similar tables. Since such tables cannot be derived mathematically, we have used a parallel genetic algorithm GAroute to design a sub-optimal routing schedule for a sequence of communication steps (neighbor-to-neighbor transfers) during group communications. Genetic evolution does not necessarily lead to the minimum number of steps, but provides satisfactory low-cost communication algorithms. Accuracy of obtained results has been tested with a regular hypercube topology with known complexity of communication.

Published
2004
Pages
980-985
Proceedings
Proceedings of the 3rd International Conference on Networking ICN '04
Conference
3rd International Conference on Networking, Gosier, Guadeloupe, GP
ISBN
0-86341-325-0
Publisher
University of Haute Alsace
Place
Colmar, FR
BibTeX
@INPROCEEDINGS{FITPUB7401,
   author = "Ji\v{r}\'{i} Staroba and V\'{a}clav Dvo\v{r}\'{a}k",
   title = "Design of Low-Cost Communication Algorithms for Irregular Networks",
   pages = "980--985",
   booktitle = "Proceedings of the 3rd International Conference on Networking ICN '04",
   year = 2004,
   location = "Colmar, FR",
   publisher = "University of Haute Alsace",
   ISBN = "0-86341-325-0",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7401"
}
Back to top