8 search results - page 1 / 2 » A note on edge fault tolerance with respect to hypercubes |
APPML
2005
13 years 4 months ago
2005
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
ENGL
2008
13 years 4 months ago
2008
The crossed cube is considered as one of the most promising variations of the hypercube topology, due to its ability of preserving many of the attractive properties of the hypercub...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
ISCI
2007
13 years 4 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
APCSAC
2005
IEEE
13 years 10 months ago
2005
IEEE
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...