Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Fault tolerant system design
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
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
An evolutionary approach to collective communication scheduling
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary design of OAB and AAB communication schedules for interconnection networks
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Reducing the impact of soft errors on fabric-based collective communications
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing - Volume 2
| Hi-index | 0.00 |
Scheduling of collective communications (CC) in interconnection networks possibly containing faulty links has been done with the use of the evolutionary techniques. Inter-node communication patterns scheduled in the minimum number of time slots have been obtained. The results show that evolutionary techniques often lead to ultimate scheduling of CC that reaches theoretical bounds on the number of steps. Analysis of fault tolerance by the same techniques revealed graceful CC performance degradation for a single link or node fault. Once the faulty region is located, CC can be re-scheduled during a recovery period.