Fault-Tolerant Resource Placement in Balanced Hypercubes

Balanced hypercube is a variant of the standard hypercube structure for multicomputers, with desirable properties of strong connectivity, regularity, and symmetry. This structure is a special type of load balancing graph designed to tolerate processor failure. In a balanced hypercube, 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. In this paper, we study the resource placement problem in balanced hypercubes. Resources can be hardware devices (such as I/O processors, disks, etc.) or software modules (such as data files, library routines, etc.). The proposed placement algorithm guarantees that each node without resource copy connects two (matching) nodes with resource copy. Therefore, one of the resource copies at each matching pair can be used as a backup to tolerate possible processor failures. Moreover, the proposed algorithm is perfect in that each node without resource copy connects two and only two nodes with resource copy and neighbors of each node with resource copy are nodes without resource copy.

[1]  Shahram Latifi,et al.  Bridged Hypercube Networks , 1990, J. Parallel Distributed Comput..

[2]  Krishnan Padmanabhan,et al.  the Twisted Cube Topology for Multiprocessors: A Study in Network Asymmetry , 1991, J. Parallel Distributed Comput..

[3]  Cauligi S. Raghavendra,et al.  Resource Allocation in Hypercube Systems , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[4]  M. Livingston,et al.  Distributing resources in hypercube computers , 1988, C3P.

[5]  Hsing-Lung Chen,et al.  Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes , 1994, IEEE Trans. Computers.

[6]  Mohan Kumar,et al.  Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes , 1992, IEEE Trans. Parallel Distributed Syst..

[7]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Nian-Feng Tzeng,et al.  Enhanced Hypercubes , 1991, IEEE Trans. Computers.

[9]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[10]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[11]  Jie Wu,et al.  Cube-connected-cubes network , 1992 .

[12]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[13]  Asok Bhattacharyya.  On a Novel Approach of Fault Detection in an Easily Testable Sequential Machine with Extra Inputs and Extra Outputs , 1983, IEEE Transactions on Computers.

[14]  Carl V. Page,et al.  Computing Prefixes on a Large Family of Interconnection Topologies , 1992, ICPP.

[15]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[16]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.