IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Distributing resources in hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
Microprocessing and Microprogramming
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Task migration in all-port wormhole-routed 2D mesh multicomputers
Information Sciences: an International Journal
Matching preclusion for balanced hypercubes
Theoretical Computer Science
Hi-index | 0.07 |
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.