Paper Info
Title
Cross-cube: a new fault tolerant hypercube-based network
Abstract
A new hypercube based computer system called n-cross cube has been developed. An n-cross cube is composed of N=2/sup n/ nodes and has a diameter equal to (n-1). Such a network has higher fault tolerance capability than an ordinary hypercube of same dimension. The cost of the proposed network is comparable with that of a hypercube. A ring/double ring of odd or even length and a complete binary tree of height n, can be embedded in such a network of dimension n. Moreover, all other geometries which can be embedded in an ordinary hypercube can also be embedded in the proposed network. Constant time routing and broadcasting algorithms for this type of networks have been developed.
Year
DOI
Venue
1991
10.1109/IPPS.1991.153821
Anaheim, CA
Keywords
Field
DocType
binary tree,parallel algorithms,fault tolerant
Broadcasting algorithms,Parallel algorithm,Computer science,Folded cube graph,Grid network,Parallel computing,Binary tree,Fault tolerance,Hypercube,Cube
Conference
ISBN
Citations 
PageRank 
0-8186-9167-0
5
0.56
References 
Authors
3
1
Name
Order
Citations
PageRank
Enamul Haq150.56