Publication detail

Design of Low-Cost Communication Algorithms for Irregular Networks

STAROBA, J. DVOŘÁK, V.

Original Title

Design of Low-Cost Communication Algorithms for Irregular Networks

Type

article in a collection out of WoS and Scopus

Language

English

Original 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.

Keywords

communications, genetic algorithms, communication architectures, parallel processing

Authors

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

RIV year

2004

Released

4. 3. 2004

Publisher

University of Haute Alsace

Location

Colmar

ISBN

0-86341-325-0

Book

Proceedings of the 3rd International Conference on Networking ICN '04

Pages from

980

Pages to

985

Pages count

6

BibTex

@inproceedings{BUT16907,
  author="Jiří {Staroba} and Václav {Dvořák}",
  title="Design of Low-Cost Communication Algorithms for Irregular Networks",
  booktitle="Proceedings of the 3rd International Conference on Networking ICN '04",
  year="2004",
  pages="980--985",
  publisher="University of Haute Alsace",
  address="Colmar",
  isbn="0-86341-325-0"
}