Distributed Recovery in Fault-Tolerant Multiprocessor Networks
IEEE Transactions on Computers
Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Reconfiguration of rings and meshes in faulty hypercubes
Journal of Parallel and Distributed Computing
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
CIS'04 Proceedings of the First international conference on Computational and Information Science
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square
Information Sciences: an International Journal
Matching preclusion for balanced hypercubes
Theoretical Computer Science
Conditional diagnosability of balanced hypercubes under the PMC model
Information Sciences: an International Journal
Conditional diagnosability of balanced hypercubes under the MM∗ model
The Journal of Supercomputing
Hi-index | 14.98 |
In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. Other properties of balanced hypercubes are examined. It is also shown that odd-dimensional balanced hypercubes have smaller diameters than that of standard hypercubes. As an application of balanced hypercubes, we show a fault-tolerant embedding of rings in balanced hypercubes.