Přístupnostní navigace
E-application
Search Search Close
Publication detail
DVOŘÁK, V. JAROŠ, J. OHLÍDAL, M.
Original Title
Optimum Topology-Aware Scheduling of Collective Communications
Type
conference paper
Language
English
Original Abstract
The paper addresses general many-to-many collective communications, whose scheduling may be needed when writing application-specific communication routines or communication libraries. Optimum schedules with the number of steps equal or close to theoretical lower bounds are designed with the use of evolutionary algorithms. Optimization is carried out for a given topology of a direct interconnection network; network nodes can be single or multiple processors connected to a router. Wormhole switching, full duplex links and single-port non-combining nodes are assumed. The developed scheduling could be advantageous mainly for networks on chip (NoC) and application-specific communication architectures.
Keywords
Many-to-many collective communications, optimum scheduling, evolutionary algorithms, fat Octagon topology
Authors
DVOŘÁK, V.; JAROŠ, J.; OHLÍDAL, M.
RIV year
2007
Released
23. 5. 2007
Publisher
IEEE Computer Society
Location
New York
ISBN
0-7695-2805-8
Book
Proceedings of The Sixth International Conference on Networking
Pages from
1
Pages to
6
Pages count
BibTex
@inproceedings{BUT28596, author="Václav {Dvořák} and Jiří {Jaroš} and Miloš {Ohlídal}", title="Optimum Topology-Aware Scheduling of Collective Communications", booktitle="Proceedings of The Sixth International Conference on Networking", year="2007", pages="1--6", publisher="IEEE Computer Society", address="New York", isbn="0-7695-2805-8" }