Publication Details

Optimum Topology-Aware Scheduling of Collective Communications

DVOŘÁK, V.; JAROŠ, J.; OHLÍDAL, M. Optimum Topology-Aware Scheduling of Collective Communications. In Proceedings of The Sixth International Conference on Networking. New York: IEEE Computer Society, 2007. p. 1-6. ISBN: 0-7695-2805-8.
Czech title
Optimální rozvrhy kolektivních komunikací "Many-to-Many" při znalosti topologie
Type
conference paper
Language
English
Authors
Dvořák Václav, prof. Ing., DrSc.
Jaroš Jiří, doc. Ing., Ph.D. (DCSY)
Ohlídal Miloš, Ing., Ph.D.
Keywords

Many-to-many collective communications, optimum scheduling, evolutionary algorithms, fat Octagon topology

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. 

Published
2007
Pages
1–6
Proceedings
Proceedings of The Sixth International Conference on Networking
ISBN
0-7695-2805-8
Publisher
IEEE Computer Society
Place
New York
EID Scopus
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",
  url="https://www.fit.vut.cz/research/publication/8328/"
}
Files
Back to top