Publication detail

Collective Communication Scheduling for Parallel Computers

STAROBA, J.

Original Title

Collective Communication Scheduling for Parallel Computers

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

A new approach to finding efficient schedule for collective communication among processing nodes in a parallel computer is introduced. It is useful especially for irregular topologies, where regular communication patterns cannot be applied. The proposed method uses genetic algorithms to search a large state space and has been designed with the intention to be easily parallelizable.

Keywords

interconnection networks, collective communication, genetic algorithms

Authors

STAROBA, J.

RIV year

2003

Released

28. 4. 2003

Location

Ostrava

ISBN

80-85988-86-0

Book

Proceedings of 37th International Conference MOSIS'03 Modelling and Simulation of Systems

Pages from

65

Pages to

70

Pages count

6

BibTex

@inproceedings{BUT13991,
  author="Jiří {Staroba}",
  title="Collective Communication Scheduling for Parallel Computers",
  booktitle="Proceedings of 37th International Conference MOSIS'03 Modelling and Simulation of Systems",
  year="2003",
  pages="65--70",
  address="Ostrava",
  isbn="80-85988-86-0"
}