Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Broadcasting in faulty hypercubes
Microprocessing and Microprogramming
An optimal fault-tolerant nonredundant broadcasting scheme in injured hypercubes
Journal of Parallel and Distributed Computing
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Improved One-to-All Broadcasting Algorithms on Faulty SIMD Hypercubes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Optimal broadcasting in injured hypercubes using directed safety levels
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Fault-tolerant routing for complete Josephus cubes
Parallel Computing - Special issue: High-performance parallel bio-computing
Research note: Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
Journal of Parallel and Distributed Computing
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
| Hi-index | 15.00 |
We consider a distributed broadcasting algorithm for injured hypercubes using incomplete spanning binomial trees. An injured hypercube is a connected hypercube with faulty nodes. The incomplete spanning binomial tree proposed in this paper is a useful structure for implementing broadcasting in injured hypercubes. It is defined as a subtree of a regular spanning binomial tree that connects all the nonfaulty nodes. We show that in an injured n-dimensional hypercube with m faulty nodes, there are at least 2n驴 2m source nodes (called l-nodes), each of which can generate an incomplete spanning binomial tree. A method is proposed to locate a large subset of the l-node set using the concept of safety level. The safety level of each node in an n-dimensional hypercube can be easily calculated through n驴 1 rounds of information exchange among neighboring nodes. An optimal broadcast initiated from a safe node is proposed. When a nonfaulty source node is unsafe and there are at most n驴 1 faulty nodes in an injured n-dimensional hypercube, the proposed broadcasting scheme requires at most n+ 1 steps.