Detail publikace

Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs

JAROŠ, J. DVOŘÁK, V.

Originální název

Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) have not been discussed in the literature as yet, contrary to pair-wise routing algorithms. The paper investigates complexity of CCs in terms of lower bounds on the number of communication steps at conflict-free scheduling. The considered networks on chip make use of wormhole switching, full duplex links and all-port non-combining nodes. A search for conflict-free scheduling of CCs has been done by means of evolutionary algorithms and the resulting numbers of communication steps have been summarized and compared to lower bounds. Time performance of CCs can be evaluated from the obtained number of steps, the given start-up time and link bandwidth. Performance prediction of applications with CCs among computing nodes of the Spidergon network is thus possible.

Klíčová slova

Collective communications, communication scheduling, evolutio-nary design, Spidergon, fat topologies, wormhole switching.

Autoři

JAROŠ, J.; DVOŘÁK, V.

Rok RIV

2010

Vydáno

27. 8. 2010

Nakladatel

Association for Computing Machinery

Místo

New York

ISBN

978-1-4503-0072-8

Kniha

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Strany od

1171

Strany do

1178

Strany počet

8

URL

BibTex

@inproceedings{BUT34825,
  author="Jiří {Jaroš} and Václav {Dvořák}",
  title="Evolutionary-Based Conflict-Free Scheduling of Collective Communications on Spidergon NoCs",
  booktitle="Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10",
  year="2010",
  pages="1171--1178",
  publisher="Association for Computing Machinery",
  address="New York",
  doi="10.1145/1830483.1830698",
  isbn="978-1-4503-0072-8",
  url="https://www.fit.vut.cz/research/publication/9252/"
}