Detail výsledku
Optimum Topology-Aware Scheduling of Many-to-Many Collective Communications
Jaroš Jiří, prof. Ing., Ph.D., UPSY (FIT)
Ohlídal Miloš, Ing., Ph.D., UPSY (FIT)
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.
Many-to-many collective communications, optimum scheduling, evolutionary algorithms, fat Octagon topology
@inproceedings{BUT28596,
author="Václav {Dvořák} and Jiří {Jaroš} and Miloš {Ohlídal}",
title="Optimum Topology-Aware Scheduling of Many-to-Many 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/"
}Návrh a obvodová realizace zařízení pro automatické generování patentovatelných invencí, GAČR, Standardní projekty, GA102/07/0850, zahájení: 2007-01-01, ukončení: 2009-12-31, ukončen
Výzkum informačních technologií z hlediska bezpečnosti, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, zahájení: 2007-01-01, ukončení: 2013-12-31, řešení