Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
A fault-tolerant communication scheme for hypercube computers
IEEE Transactions on Computers
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Dimension ordering and broadcast algorithms in faulty SIMD hypercubes
Journal of Parallel and Distributed Computing
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
Fault tolerant broadcasting in SIMD hypercubes
SPDP '93 Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
Consider an n-dimensional SIMD hypercube H"n with @?3n/2@?-1 faulty nodes. With n+3log(n-1)+7,n+2log(n-1)+9,n+log(n-1)+O(loglog(n-1)),n+log(n-1)+12, and n+19 steps, this paper presents some one-to-all broadcasting algorithms on the faulty SIMD H"n. The sequence of dimensions used for broadcasting in each algorithm is the same regardless of which node is the source. The proposed one-to-all broadcasting algorithms can tolerate @?n/2@? more faulty nodes than Raghavendra and Sridhar's algorithms (J. Parallel Distrb. Comput. 35 (1996) 57) although 8 extra steps are needed. The fault-tolerance improvement of this paper is about 50%.