Detail publikace

Collective Communication Scheduling for Parallel Computers

Originální název

Collective Communication Scheduling for Parallel Computers

Anglický název

Collective Communication Scheduling for Parallel Computers

Jazyk

en

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.

BibTex


@inproceedings{BUT13991,
  author="Jiří {Staroba}",
  title="Collective Communication Scheduling for Parallel Computers",
  annote="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.",
  booktitle="Proceedings of 37th International Conference MOSIS'03 Modelling and Simulation of Systems",
  chapter="13991",
  year="2003",
  month="april",
  pages="65--70",
  type="conference paper"
}