A new fault-tolerant multicast communication in multicomputers
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
In this paper a new unicast-based fault-tolerant multicast routing algorithm is presents for mesh-connected multicomputers. The fault tolerant multicast routing algorithm is local-information-based and distributed. The algorithm based on the concept of k-submesh for mesh networks. The mesh is divided into some disjoint k-submeshes in this scheme. Multicast message route and all operations are completed in k-submesh each other. The running time of the algorithm is in liner. Simulation results show that the time steps of the algorithm are very close to the optimum in practice.
name of conference
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA '03, June 23 - 26, 2003, Las Vegas, Nevada, USA, Volume 3