Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Time-step optimal broadcasting in 3-D meshes with minimum total communication distance
Journal of Parallel and Distributed Computing
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Multicast Communication in Multicomputer Networks
IEEE Transactions on Parallel and Distributed Systems
A Distributed Formation of Orthogonal Convex Polygons in Mesh-Connected Multicomputers
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fault-Tolerant Broadcasting in Wormhole-Routed Torus Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Minimizing Total Communication Distance of a Time-Step Optimal Broadcast in Mesh Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Applying 4-regular grid structures in large-scale access networks
Computer Communications
Online adaptive fault-tolerant routing in 2d torus
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
In this paper, a fault-tolerant broadcast scheme in 2-D meshes with randomly generated faults is provided. This approach is based on an early work on time-step optimal broadcasting in square-shape fault-free 2-D meshes with optimal total communication distance (TCD). An extension to any rectangular-shape fault-free 2-D meshes is first given. The fault block model is used in which all faulty nodes in the system are contained in a set of disjoint blocks. The boundary lines of blocks divide the whole mesh into a set of fault-free polygons and a sequence of rectangular fault-free regions is derived from these polygons. The broadcast process is carried out at two levels: inter-region and intra-region. In the inter-region-level broadcast, the broadcast message is sent from a given source to a special node (called eye [1]) in each rectangular fault-free region. In the intra-region-level broadcast, the extended optimal fault-free broadcast is applied. Some analytical results are given including an upper bound of TCD.