Efficient fault-tolerant multicast scheme for hypercube multicomputers

This paper presents a fault-tolerant multicast scheme for hypercube multicomputers. The method is based on the routing capability information that is stored in each node. In comparison with the previous schemes, this information is able to capture the fault status more precisely. Two multicast algorithms are presented in the paper. These algorithms multicast messages in an attempt to minimize derouting so that time optimality can be achieved. Moreover, the routing capability information is used to guide derouting in an efficient manner when such needs arise. The amount of traffic incurred is addressed in the paper. The hardware design for the algorithms is also discussed. Extensive simulation has been conducted to evaluate the performance of the scheme. The results show the effectiveness of the proposed algorithms