Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
A Model of SIMD Machines and a Comparison of Various Interconnection Networks
IEEE Transactions on Computers
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Improving bounds on link failure tolerance of the star graph
Information Sciences: an International Journal
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
The n-cube network is called faulty if it contains any faulty processor or any faulty link. For any number k we want to compute the minimum number f(n, k) of faults which is necessary for an adversary to make every (n - k)-dimensional subcube faulty. Reversely formulated: The existence of an (n - k)-dimensional non-faulty subcube can be guaranteed, if there are less than f(n, k) faults in the n-cube. In this paper several lower and upper bounds for f(n, k) are derived such that the resulting gaps are ''small.'' For instance if k = 2 is constant, then f(n, k) = @q(logn). Especially for k = 2 and large n: f(n, 2) @? [[@a"n@?]: [@a"n]@? + 2], where @a"n =logn + 1/2 log log n + 1/2. Or if k = @w(log log n) then 2^k