
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
QianPing Gu, Shietung Peng, "Unicast in Hypercubes with Large Number of Faulty Nodes," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 10, pp. 964975, October, 1999.  
BibTex  x  
@article{ 10.1109/71.808128, author = {QianPing Gu and Shietung Peng}, title = {Unicast in Hypercubes with Large Number of Faulty Nodes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {10}, number = {10}, issn = {10459219}, year = {1999}, pages = {964975}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.808128}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Unicast in Hypercubes with Large Number of Faulty Nodes IS  10 SN  10459219 SP964 EP975 EPD  964975 A1  QianPing Gu, A1  Shietung Peng, PY  1999 KW  Fault tolerance KW  interconnection network KW  offline routing algorithm KW  unicast KW  hypercubes. VL  10 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Unicast in computer/communication networks is a onetoone communication between a source node
[1] J.C. Bermond, “Interconnection Networks,” Discrete Applied Math, special issue, 1992.
[2] J.C. Bermond, N. Homobono, and C. Peyrat, “Large FaultTolerant Interconnection Networks,” Graphs and Combinatorics, vol. 5, 1989.
[3] J. Bruck, R. Cypher, and D. Soroker, "Tolerating Faults in Hypercubes Using Subcube Partitioning," IEEE Trans. Computers, vol. 41, no. 5, pp. 599605, May 1992.
[4] 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.
[5] H. Chernoff, “A Measure of Asymptotic Efficiency for Tests of a Hypotheses Based on the Sum of Observations,” Ann. Math. Stat., vol. 23, pp. 493509, 1952.
[6] P. Erdös and I. Spencer, Probabilistic Method in Combinatorics. New York: Academic Press, 1974.
[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] J.M. Gordon and Q.F. Stout, “Hypercube Message Routing in the Presence of Faults,” Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 318327, Jan. 1988.
[9] Q. Gu and S. Peng, “Optimal Algorithms for NodetoNode Fault Tolerant Routing in Hypercubes,” The Computer J., vol. 39, no. 7, pp. 626629, 1996.
[10] Q.P. Gu and S. Peng, “kPairwise Cluster Fault Tolerant Routing in Hypercubes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 10421049, Sept. 1997.
[11] Q. Gu and S. Peng, “Cluster Fault Tolerant Routing in Hypercubes,“ Proc. 1998 Int'l Conf. of Parallel Processing, pp. 252255, 1998.
[12] D.F. Hsu, “Interconnection Networks and Algorithms,” Networks, vol. 23, no. 4, 1993.
[13] D.F. Hsu, “On Container with Width and Length in Graphs, Groups, and Networks,” IEICE Trans. Fundamental of Electronics, Information, and Computer Sciences, vol. E77A, no. 4, pp. 668680, 1994.
[14] Y. Lan, “A FaultTolerant Routing Algorithm in Hypercubes,“ In Proc. 1994 Int'l Conf. Parallel Processing, pp. III163III166, 1994.
[15] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 2733, 1993.
[16] S. Latifi, M. Hedge, and M. NaraghiPour, “Conditional Connectivity Measures for Large Multipprocessor Systems,” IEEE Trans. Computers, vol. 43, no. 2, pp. 218222, 1994.
[17] 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.
[18] M. Peercy and P. Banerjee, “Optimal Distributed DeadlockFree Algorithms for Routing and Broadcasting in Arbitrarily Faulty Hypercubes,“ Proc. 20th Int'l Symp. on FaultTolerant Computing, 1990.
[19] C.S. Raghavendra, P.J. Yang, and S.B. Tien, “Free Dimensions—An Efficient Approach to Archieving Fault Tolerance in Hypercube,“ IEEE Trans. Computers, vol. 44, pp. 1,1521,157, 1995.
[20] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[21] 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.
[22] J. Wu, “Safety Levels—An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes,” IEEE Trans. Computers, vol. 44, no. 5, pp. 702706, May 1995.
[23] J. Wu, "Unicasting in Faulty Hypercubes Using Safety Levels," IEEE Trans. Computers, vol. 46, no. 2, pp. 241247, Feb. 1997.