Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
On the permutation capability of multistage interconnection networks
IEEE Transactions on Computers
Methodologies for analysis and design of data routers in large SIMD computers
Methodologies for analysis and design of data routers in large SIMD computers
Permutation capability of optical multistage interconnection networks: 72
Journal of Parallel and Distributed Computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Computer Architecture, Fourth Edition: A Quantitative Approach
Computer Architecture, Fourth Edition: A Quantitative Approach
An evolutionary approach to collective communication scheduling
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
The Performance of Multistage Interconnection Networks for Multiprocessors
IEEE Transactions on Computers
Evolutionary design of OAB and AAB communication schedules for interconnection networks
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
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.