Efficient and scalable hardware-based multicast in fat-tree networks
|Research Area:||Swicth Architectures||Year:||2009|
|Type of Publication:||Article||Keywords:||Computer hardware;Convolutional codes;Multicasting;Routing algorithms;Switching circuits;|
|Journal:||IEEE Transactions on Parallel and Distributed Systems||Volume:||20|
|Number:||9||Pages:||1285 - 1298|
Data communications;Interprocessor communications;Multicast;Network communication;Network problems;Trees;
This article presents an efficient and scalable mechanism to overcome the limitations of collective communication in switched interconnection networks in the presence of faults. Considering that current trends in supercomputing are moving toward massively parallel computers, with many thousands of components, reliability becomes a challenge. In such scenario, fat-tree networks that provide hardware support for collective communication suffer from serious performance degradation due to the presence of, even, a single faulty node. This paper describes a new mechanism to provide high-performance collective communication in such situations. The feasibility of the proposed technique is formally demonstrated. We present the design of a new hardware-based routing algorithm for multicast, that is at the base of our proposal. The proposed mechanism is implemented and experimentally evaluated. Our experimental results show that hardware-based multicast trees provide an efficient and scalable solution for collective communication in fat-tree networks, significantly outperforming traditional solutions. © 2009 IEEE.