Publication detail

Evolutionary Design of Group Communication Schedules for Interconnection Networks

JAROŠ, J., OHLÍDAL, M., DVOŘÁK, V.

Original Title

Evolutionary Design of Group Communication Schedules for Interconnection Networks

English Title

Evolutionary Design of Group Communication Schedules for Interconnection Networks

Type

conference paper

Language

en

Original Abstract

As chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of optimization. Group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific Bayesian Optimization Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic Simulated Annealing) to design optimal communication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The group communication schedules were designed for an asymmetrical AMP network on one hand and for the benchmark hypercube network on the other, using SF (Store-and-Forward) and WH (Wormhole) switching.

English abstract

As chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of optimization. Group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific Bayesian Optimization Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic Simulated Annealing) to design optimal communication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The group communication schedules were designed for an asymmetrical AMP network on one hand and for the benchmark hypercube network on the other, using SF (Store-and-Forward) and WH (Wormhole) switching.

Keywords

Genetic algorithms, collective communications

RIV year

2005

Released

26.08.2005

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-540-29414-6

Book

Proceedings of the 20th International Symposium Computer and Information Sciences - ISCIS 2005

Edition

Lecture Notes in Computer Science 3733

Pages from

472

Pages to

481

Pages count

10

BibTex


@inproceedings{BUT29275,
  author="Jiří {Jaroš} and Miloš {Ohlídal} and Václav {Dvořák}",
  title="Evolutionary Design of Group Communication Schedules for Interconnection Networks",
  annote="As chip multiprocessors are quickly penetrating new application areas in
 network and media processing, their interconnection architectures 
become a subject of optimization. Group communications are frequently 
used in many parallel algorithms and if their overhead is excessive, 
performance degrades rapidly with a processor count. This paper deals 
with the design of a new application-specific Bayesian Optimization 
Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic 
Simulated Annealing) to design optimal communication algorithms for an 
arbitrary topology of the interconnection network. Each of these 
algorithms is targeted for a different switching technique. The group 
communication schedules were designed for an asymmetrical AMP network on
 one hand and for the benchmark hypercube network on the other, using SF
 (Store-and-Forward) and WH (Wormhole) switching.",
  address="Springer Verlag",
  booktitle="Proceedings of the 20th International Symposium Computer and Information Sciences - ISCIS 2005",
  chapter="29275",
  edition="Lecture Notes in Computer Science 3733",
  institution="Springer Verlag",
  journal="Lecture Notes in Computer Science (IF 0,513)",
  year="2005",
  month="august",
  pages="472--481",
  publisher="Springer Verlag",
  type="conference paper"
}