Detail publikačního výsledku

Collective Communication Scheduling for Parallel Computers

STAROBA, J.

Originální název

Collective Communication Scheduling for Parallel Computers

Anglický název

Collective Communication Scheduling for Parallel Computers

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

interconnection networks, collective communication, genetic algorithms

Klíčová slova v angličtině

interconnection networks, collective communication, genetic algorithms

Autoři

STAROBA, J.

Vydáno

28.04.2003

Nakladatel

Marq software s.r.o.

Místo

Ostrava

ISBN

80-85988-86-0

Kniha

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

Strany od

65

Strany do

70

Strany počet

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",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-85988-86-0"
}