Detail publikace

Evolutionary Optimization of Multistage Interconnection Networks Performance

Originální název

Evolutionary Optimization of Multistage Interconnection Networks Performance

Anglický název

Evolutionary Optimization of Multistage Interconnection Networks Performance

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT33732,
  author="Jiří {Jaroš}",
  title="Evolutionary Optimization of Multistage Interconnection Networks Performance",
  annote="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.",
  address="Association for Computing Machinery",
  booktitle="Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2009",
  chapter="33732",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Association for Computing Machinery",
  year="2009",
  month="july",
  pages="1537--1544",
  publisher="Association for Computing Machinery",
  type="conference paper"
}