DocumentCode :
1813353
Title :
Pyramided hypercube: an extendable cubic network with fixed degree
Author :
Chiang, Wei-Kuo ; Chen, Rong-Jaye
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
1994
fDate :
19-22 Dec 1994
Firstpage :
690
Lastpage :
697
Abstract :
The proposed network is a pyramid-like network of hypercubes, called pyramided hypercube. A pyramided hypercube containing m levels and having n-cube as basic configuration is denoted by PH(m,n). A PH(m,n) with fixed degree n+2, possesses logarithmic diameter, optimal fault tolerance, and capability of simple routing. The PH(m,n) can be extended smoothly with a constant predefined building block based on its recursive structure such that there is no change in the basic node configuration as we increase the network size. Moreover, links once connected are left undisturbed when the network grows in size. The PH(m,n) is also Hamiltonian
Keywords :
fault tolerant computing; hypercube networks; network routing; parallel architectures; reliability; Hamiltonian; basic node configuration; constant predefined building block; extendable cubic network; logarithmic diameter; n-cube; network size; optimal fault tolerance; pyramided hypercube; recursive structure; simple routing; Computer science; Electronic mail; Fault tolerance; Hardware; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel architectures; Partitioning algorithms; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems, 1994. International Conference on
Conference_Location :
Hsinchu
Print_ISBN :
0-8186-6555-6
Type :
conf
DOI :
10.1109/ICPADS.1994.590441
Filename :
590441
Link To Document :
بازگشت