3 search results - page 1 / 1 » Optimal fault-tolerant embedding of paths in twisted cubes |
JPDC
2007
13 years 4 months ago
2007
TPDS
2008
13 years 4 months ago
2008
Let k 4 be even and let n 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv +fe 2n-2. We prove that ...
LCTRTS
2009
Springer
13 years 11 months ago
2009
Springer
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...