DocumentCode
686363
Title
The Exchanged Folded Hypercube
Author
Yang Li ; Heng Qi ; Zhiyang Li ; Keqiu Li
Author_Institution
Sch. of Comput. Sci. & Technol., Dalian Univ. of Technol., Dalian, China
fYear
2013
fDate
13-15 Nov. 2013
Firstpage
45
Lastpage
50
Abstract
In this paper, we present and analyze a new hypercube type structure called the Exchanged Folded Hypercube(EFH), which is designed on the basis of the Exchanged Hypercube (EH). Compared to EH, EFH holds some features such as halved diameter of its parent topologies, lower cost factor and constant node degree. For the new proposed design, we develop the optimal routing algorithms which are simple and easy to implement. Furthermore, some fault tolerance capabilities of EFH are quantified such as fault diameter and cost effectiveness factor. Extensive comparisons of EFH with the state-of-art hyper cubes are included, which prove that EFH offers substantial improvement in terms of the above mentioned network parameters.
Keywords
fault tolerant computing; hypercube networks; network routing; network theory (graphs); EFH structure; constant node degree; cost effectiveness factor; exchanged folded hypercube structure; fault diameter; fault tolerance capabilities; network parameters; optimal routing algorithms; parent topologies; Algorithm design and analysis; Broadcasting; Fault tolerance; Fault tolerant systems; Hypercubes; Routing; Topology; fault tolerance; hypercube; network; spanning tree; topology;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), 2013 IEEE 10th International Conference on
Conference_Location
Zhangjiajie
Type
conf
DOI
10.1109/HPCC.and.EUC.2013.16
Filename
6825543
Link To Document