38 search results - page 1 / 8 » Hamiltonian fault-tolerance of hypercubes |
JSA
2000
13 years 5 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
ICPP
1993
IEEE
13 years 10 months ago
1993
IEEE
- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subc...
EUROPDS
1997
13 years 7 months ago
1997
In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare nod...
APPML
2005
13 years 5 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...
SPDP
1993
IEEE
13 years 9 months ago
1993
IEEE
- In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n+1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the ...