Detail publikačního výsledku

Optimum Topology-Aware Scheduling of Many-to-Many Collective Communications

DVOŘÁK, V.; JAROŠ, J.; OHLÍDAL, M.

Originální název

Optimum Topology-Aware Scheduling of Many-to-Many Collective Communications

Anglický název

Optimum Topology-Aware Scheduling of Many-to-Many Collective Communications

Druh

Stať ve sborníku v databázi WoS či Scopus

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. 

Klíčová slova

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

Klíčová slova v angličtině

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

Autoři

DVOŘÁK, V.; JAROŠ, J.; OHLÍDAL, M.

Rok RIV

2010

Vydáno

23.05.2007

Nakladatel

IEEE Computer Society

Místo

New York

ISBN

0-7695-2805-8

Kniha

Proceedings of The Sixth International Conference on Networking

Strany od

1

Strany do

6

Strany počet

6

URL

https://www.fit.vut.cz/research/publication/8328/

BibTex

@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/"
}

Dokumenty

Dvorak-OptimumTopology