Detail publikace

Genetic Algorithm Optimization of Group Communications

Originální název

Genetic Algorithm Optimization of Group Communications

Anglický název

Genetic Algorithm Optimization of Group Communications

Jazyk

en

Originální abstrakt

This paper presents a genetic algorithm application in area of parallel computing. An algorithm which optimizes routing of messages in message passing parallel computers is introduced. Initial implementation has been tested for regular architectures with known reachable lower bounds of communication complexity. A real application area of the algorithm includes especially irregular interconnection networks, where regular communication patterns cannot be applied. The algorithm is intended to be run especially on parallel computers which makes searching for solutions of larger scale problems feasible. Therefore, a parallel version of the algorithm is also proposed.

Anglický abstrakt

This paper presents a genetic algorithm application in area of parallel computing. An algorithm which optimizes routing of messages in message passing parallel computers is introduced. Initial implementation has been tested for regular architectures with known reachable lower bounds of communication complexity. A real application area of the algorithm includes especially irregular interconnection networks, where regular communication patterns cannot be applied. The algorithm is intended to be run especially on parallel computers which makes searching for solutions of larger scale problems feasible. Therefore, a parallel version of the algorithm is also proposed.

BibTex


@inproceedings{BUT14169,
  author="Jiří {Staroba} and Václav {Dvořák}",
  title="Genetic Algorithm Optimization of Group Communications",
  annote="This paper presents a genetic algorithm application in area of parallel computing. An algorithm which optimizes routing of messages in message passing parallel computers is introduced. Initial implementation has been tested for regular architectures with known reachable lower bounds of communication complexity. A real application area of the algorithm includes especially irregular interconnection networks, where regular communication patterns cannot be applied. The algorithm is intended to be run especially on parallel computers which makes searching for solutions of larger scale problems feasible. Therefore, a parallel version of the algorithm is also proposed.",
  address="Faculty of Mechanical Engineering BUT",
  booktitle="9th International Conference on Soft Computing Mendel 2003",
  chapter="14169",
  institution="Faculty of Mechanical Engineering BUT",
  year="2003",
  month="june",
  pages="47--52",
  publisher="Faculty of Mechanical Engineering BUT",
  type="conference paper"
}