z-logo
open-access-imgOpen Access
Evolutionary optimization of multistage interconnection networks performance
Author(s) -
Jiří Jaroš
Publication year - 2009
Publication title -
proceedings of the 11th annual conference on genetic and evolutionary computation
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1569901.1570107
Subject(s) - interconnection , computer science , multistage interconnection networks , routing (electronic design automation) , distributed computing , binary tree , clos network , communication source , tree (set theory) , computer network , topology (electrical circuits) , binary number , unicast , parallel computing , multicast , algorithm , mathematics , mathematical analysis , arithmetic , combinatorics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom