Title :
Cross-cube: a new fault tolerant hypercube-based network
Author_Institution :
Landis & Gyr Syst. Inc., San Jose, CA, USA
fDate :
30 Apr-2 May 1991
Abstract :
A new hypercube based computer system called n-cross cube has been developed. An n-cross cube is composed of N=2n 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
Keywords :
fault tolerant computing; hypercube networks; parallel algorithms; trees (mathematics); binary tree; broadcasting algorithms; diameter; fault tolerant hypercube-based network; hypercube based computer system; n-cross cube; nodes; ring/double ring; time routing algorithms; Binary trees; Broadcasting; Computer networks; Costs; Drives; Fault tolerance; Geometry; Hypercubes; Network topology; Routing;
Conference_Titel :
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-9167-0
DOI :
10.1109/IPPS.1991.153821