
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Chen, G. Wang, S. Chen, "Locally SubcubeConnected Hypercube Networks: Theoretical Analysis and Experimental Results," IEEE Transactions on Computers, vol. 51, no. 5, pp. 530540, May, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1004592, author = {J. Chen and G. Wang and S. Chen}, title = {Locally SubcubeConnected Hypercube Networks: Theoretical Analysis and Experimental Results}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {5}, issn = {00189340}, year = {2002}, pages = {530540}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1004592}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Locally SubcubeConnected Hypercube Networks: Theoretical Analysis and Experimental Results IS  5 SN  00189340 SP530 EP540 EPD  530540 A1  J. Chen, A1  G. Wang, A1  S. Chen, PY  2002 KW  Interconnection network KW  hypercube KW  routing algorithm KW  fault tolerance VL  51 JA  IEEE Transactions on Computers ER   
We study hypercube networks with a very large number of faulty nodes. A simple and natural condition, the
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] J. Chen, G. Wang, and S. Chen, “Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes,” Proc. Fourth Int'l Conf. Algorithms and Architecture for Parallel Processing (ICA3PP 2000), pp. 605616, 2000.
[3] M.S. Chen and K.G. Shin, "DepthFirst Search Approach for FaultTolerant Routing in Hypercube Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 152159, Apr. 1990.
[4] T.C. Lee and J.P. Hayes,“A faulttolerant communication scheme for hypercube computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 1,2421,256, Oct. 1992.
[5] G.M. Chiu and S.P. Wu, "A FaultTolerant Routing Strategy in Hypbercube Multicomputers," IEEE Trans. Computers, vol. 45, no. 2, pp. 143156, Feb. 1996.
[6] A.L. DeCegama, The Technology of Parallel Processing—Parallel Processing Architectures and VLSI Hardware, vol. 1. Prentice Hall, 1989.
[7] A.H. Esfahanian, “Generalized Measures of Fault Tolerance with Application to nCube Networks,” IEEE Trans. Computers, vol. 38, no. 11, pp. 1,5861,591, 1989.
[8] Q.P. Gu and S. Peng, “Optimal Algorithms for NodetoNode Fault Tolerant Routing in Hypercubes,” The Computer J., vol. 39, pp. 626629, 1996.
[9] Q.P. Gu and S. Peng, “kPairwise Cluster Fault Tolerant Routing in Hypercubes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 10421049, Sept. 1997.
[10] Q P. Gu and S. Peng, “Unicast in Hypercubes with Large Number of Faulty Nodes,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 964975, 1999.
[11] Q.P. Gu and S. Peng, “An Efficient Algorithm for thekPairwise Disjoint Paths Problem in Hypercubes,” J. Parallel and Distributed Computing, vol. 60, pp. 764774, 2000.
[12] Intel Corp., Intel iPSC System Overview, Jan. 1986.
[13] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 2733, 1993.
[14] S. Latifi, M. Hedge, and M. NaraghiPour, “Conditional Connectivity Measures for Large Multipprocessor Systems,” IEEE Trans. Computers, vol. 43, no. 2, pp. 218222, 1994.
[15] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[16] W. Najjar and J.L. Gaudiot, “Network Resilience: A Measure of Network Fault Tolerance,” IEEE Trans. Computers, vol. 39, pp. 174181, 1990.
[17] NCUBE Corp., NCUBE/ten: An Overview, Beaverton, Ore., Nov. 1985.
[18] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335348, 1989.
[19] S.B. Tien and C.S. Raghavendra,“Algorithms and bounds for shortest paths and diameter in faultyhypercubes,” IEEE Trans. Parallel and Distributed Systems, pp. 713718, June 1993.
[20] A. Wagner and D. Corneil,“Embedding trees in a hypercube is NPcomplete,” SIAM J. Computing, vol. 19, no. 3, pp. 570590, June 1990.
[21] J. Wu, "Unicasting in Faulty Hypercubes Using Safety Levels," IEEE Trans. Computers, vol. 46, no. 2, pp. 241247, Feb. 1997.