Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
JAROŠ, J. OHLÍDAL, M. DVOŘÁK, V.
Originální název
An Evolutionary Approach to Collective Communication Scheduling
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
In this paper, we describe two evolutionary algorithms aimed at scheduling collective communications on interconnection networks of parallel computers. To avoid contention for links and associated delays, collective communications proceed in synchronized steps. Minimum number of steps is sought for the given network topology, wormhole (pipelined) switching, minimum routing and given sets of sender and/or receiver nodes. Used algorithms are able not only re-invent optimum schedules for known symmetric topologies like hyper-cubes, but they can find schedules even for any asymmetric or irregular topologies in case of general many-to-many collective communications. In most cases does the number of steps reach the theoretical lower bound for the given type of collective communication; if it does not, non-minimum routing can provide further improvement. Optimum schedules may serve for writing high-performance communication routines for application-specific networks on chip or for development of communication libraries in case of general-purpose interconnection networks.
Klíčová slova
Collective communications, communication scheduling, evolutionary optimization.
Autoři
JAROŠ, J.; OHLÍDAL, M.; DVOŘÁK, V.
Rok RIV
2007
Vydáno
10. 7. 2007
Nakladatel
Association for Computing Machinery
Místo
New York
ISBN
978-1-59593-697-4
Kniha
2007 Genetic and Evolutionary Computation Conference
Edice
Volume II
Strany od
2037
Strany do
2044
Strany počet
8
BibTex
@inproceedings{BUT28801, author="Jiří {Jaroš} and Miloš {Ohlídal} and Václav {Dvořák}", title="An Evolutionary Approach to Collective Communication Scheduling", booktitle="2007 Genetic and Evolutionary Computation Conference", year="2007", series="Volume II", pages="2037--2044", publisher="Association for Computing Machinery", address="New York", isbn="978-1-59593-697-4" }