Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Distributed fault-tolerant embeddings of rings in hypercubes
Journal of Parallel and Distributed Computing
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Hamiltonian Path and Cycle in Hypercubes with Faulty Links
ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
In parallel computers which have a large number of processors, it is not uncommon for nodes or links between nodes to fail. This experience has motivated investigations into how able different interconnection networks are to cope with a limited number of node and/or link faults. Most investigations have focussed on the resulting communication capabilities or embeddability of faulty interconnection networks, e.g., whethera certain network is still connected or whether certain guest networks can still be embedded in certain host networks, given a limited number of faults. Also, most research has centered around hypercubes and the k-ary n-cube has not been considered to such a great extent.