Ninth International Conference on Parallel and Distributed Systems (ICPADS'02)
Cycle Embedding in a Faulty Hypercube
Taiwan, ROC
December 17-December 20
ISBN: 0-7695-1760-9
The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a fault-free cycle of length of at least 2n -2f can be embedded in an n dimensional hypercube with f faulty nodes, where n \ge 3 and 1 \le f \le 2n - 4. The best known results thus far can tolerant only n -1 faulty nodes.