Detail publikace
Optimum Topology-Aware Scheduling of Collective Communications
Originální název
Optimum Topology-Aware Scheduling of Collective Communications
Anglický název
Optimum Topology-Aware Scheduling of Collective Communications
Jazyk
en
Originální abstrakt
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.
Anglický abstrakt
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.
BibTex
@inproceedings{BUT28596,
author="Václav {Dvořák} and Jiří {Jaroš} and Miloš {Ohlídal}",
title="Optimum Topology-Aware Scheduling of Collective Communications",
annote="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. ",
address="IEEE Computer Society",
booktitle="Proceedings of The Sixth International Conference on Networking",
chapter="28596",
howpublished="print",
institution="IEEE Computer Society",
year="2007",
month="may",
pages="1--6",
publisher="IEEE Computer Society",
type="conference paper"
}