Genetic Algorithm Optimization of Group Communications
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F03%3APU42566" target="_blank" >RIV/00216305:26230/03:PU42566 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Genetic Algorithm Optimization of Group Communications
Original language description
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 withknown 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 especiially on parallel computers which makes searching for solutions of larger scale problems feasible. Therefore, a parallel version of the algorithm is also proposed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F02%2F0503" target="_blank" >GA102/02/0503: Parallel performance prediction and tuning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
9th International Conference on Soft Computing Mendel 2003
ISBN
80-214-2411-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
47-52
Publisher name
Faculty of Mechanical Engineering BUT
Place of publication
Brno
Event location
Brno
Event date
May 9, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—