Routing and broadcasting in faulty hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Broadcasting in faulty hypercubes
Microprocessing and Microprogramming
Structural and Tree Embedding Aspects of Incomplete Hypercubes
IEEE Transactions on Computers
Embedding K-ary complete trees into hypercubes
Journal of Parallel and Distributed Computing
Routing a permutation in the hypercube by two sets of edge disjoint paths
Journal of Parallel and Distributed Computing
Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
IEEE Transactions on Parallel and Distributed Systems
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A Large Scale, Homogenous, Fully Distributed Parallel Machine, II
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Fault-tolerant multicasting in hypercubes using local safety information
Journal of Parallel and Distributed Computing
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hypercube (n-cube) is associated with a sequence of directed safety levels. A directed safety level associated with node u is an approximated measure of broadcast capability of performing optimal broadcasting from u in an (n - 1)-subcube containing u. By optimal broadcasting, we mean that the broadcast message reaches each destination through a shortest path (i.e., the length of each path is equal to the Hamming distance between the source and destination). Directed safety levels are based on a special coding scheme generalized from Wu's safety level model and are calculated through n - 1 rounds of information exchanges and updates among neighboring nodes. In this model, fault information of nodes within distance-d is precisely represented to better capture link faults, whereas fault information of nodes outside distance-d is approximated as in the regular safety level model. Optimal broadcasting at node u is guaranteed if node u is globally safe, which is defined in terms of the directed safety levels associated with u. The directed safety level model with d = 1 or d = 2 has the same asymptotic complexity as the regular safety level model. Simulation results show a significant improvement in terms of optimal broadcast capability in injured hypercubes.