Publication detail

Optimum Topology-Aware Scheduling of Collective Communications

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

Original Title

Optimum Topology-Aware Scheduling of Collective Communications

English Title

Optimum Topology-Aware Scheduling of Collective Communications

Type

conference paper

Language

en

Original 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. 

English 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. 

Keywords

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

RIV year

2007

Released

23.05.2007

Publisher

IEEE Computer Society

Location

New York

ISBN

0-7695-2805-8

Book

Proceedings of The Sixth International Conference on Networking

Pages from

1

Pages to

6

Pages count

6

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