Publication Details

Evolutionary Optimization of Multistage Interconnection Networks Performance

JAROŠ, J. Evolutionary Optimization of Multistage Interconnection Networks Performance. In Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2009. New York: Association for Computing Machinery, 2009. p. 1537-1544. ISBN: 978-1-60558-325-9.
Czech title
Evoluční optimalizace výkonu vícestupňových propojovacích sítí
Type
conference paper
Language
English
Authors
Keywords

Collective communications, communication scheduling, evolutionary design, multistage interconnection networks

Abstract

The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly and Clos are investigated. The study is completed by bidirectional binary, fat and full binary tree. To avoid link contentions and associated delays, collective communications are processed in synchronized steps. Minimum number of steps is sought for the given network topology, wormhole switching, minimum routing and given sets of sender and/or receiver nodes. Evolutionary algorithm proposed in this paper is able to design optimal schedules for broadcast and scatter collective communications. Acquired optimum schedules can simplify the consecutive writing high-performance communication routines for application-specific networks on chip, or for development of communication libraries in case of general-purpose multistage interconnection networks.

Published
2009
Pages
1537–1544
Proceedings
Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2009
ISBN
978-1-60558-325-9
Publisher
Association for Computing Machinery
Place
New York
EID Scopus
BibTeX
@inproceedings{BUT33732,
  author="Jiří {Jaroš}",
  title="Evolutionary Optimization of Multistage Interconnection Networks Performance",
  booktitle="Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2009",
  year="2009",
  pages="1537--1544",
  publisher="Association for Computing Machinery",
  address="New York",
  isbn="978-1-60558-325-9",
  url="https://www.fit.vut.cz/research/publication/8983/"
}
Back to top