loading...
Cycle Embedding in a Faulty Hypercube
Taiwan, ROC December 17-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPADS.2002.1183370Ninth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jung-Sheng Fu, National Lien-Ho Institute of Technology
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.
Citation:
Jung-Sheng Fu, "Cycle Embedding in a Faulty Hypercube," icpads, pp.5, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.