
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
PeiJi Yang, C.s. Raghavendra, SingBan Tien, "Free DimensionsAn Effective Approach to Achieving Fault Tolerance in Hypercubes," IEEE Transactions on Computers, vol. 44, no. 9, pp. 11521157, September, 1995.  
BibTex  x  
@article{ 10.1109/12.464395, author = {PeiJi Yang and C.s. Raghavendra and SingBan Tien}, title = {Free DimensionsAn Effective Approach to Achieving Fault Tolerance in Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {9}, issn = {00189340}, year = {1995}, pages = {11521157}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.464395}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Free DimensionsAn Effective Approach to Achieving Fault Tolerance in Hypercubes IS  9 SN  00189340 SP1152 EP1157 EPD  11521157 A1  PeiJi Yang, A1  C.s. Raghavendra, A1  SingBan Tien, PY  1995 KW  Hypercubes KW  fault tolerance KW  embedding KW  reconfiguration KW  routing and broadcasting. VL  44 JA  IEEE Transactions on Computers ER   
Given an
[1] B. Aiello and T. Leighton, "Coding Theory, Hypercube Embeddings, and Fault Tolerance," Proc. Third Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 125136, July 1991.
[2] B. Becker and H. Simon,“How robust is the ncube?” Information and Computation, pp. 162178, 1988.
[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.Y. Chan and S.J. Lee, "FaultTolerant Embedding of Complete Binary Trees in Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 277288, Mar. 1993.
[5] Y. Chang,“Fault tolerant broadcasting in SIMD hypercubes,” Proc. Fifth Symp. Parallel and Distributed Processing, pp. 348351, Dec. 1993.
[6] S.K. Chen, C.T. Liang, and W.T. Tsai, "An Efficient MultiDimensional Grids Reconfiguration Algorithm on Hypercubes," Proc. 18th In'l Symp. FaultTolerant Computing, pp. 368373, 1988.
[7] 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.
[8] B.S. Chlebus, K. Diks, and A. Pelc, "Optimal Broadcasting in Fault Hypercubes," Proc. IEEE 21st Int'l Symp. FaultTolerant Computing, pp. 266273, June 1991.
[9] S. Dutt and J.P. Hayes, “Designing FaultTolerant Systems Using Automorphisms,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 249–268, 1991.
[10] F. Harary,J.P. Hayes,, and H.J. Wu,“A survey of the theory of hypercube graphs,” Comput. Math. Applic., pp. 277289, 1988.
[11] J. Hastad,T. Leighton,, and M. Newman,“Fast computation using faulty hypercubes,” Proc. 21st ACM Symp. Theory of Computing, 1989.
[12] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[13] 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.
[14] T.C. Lee,“Quick recovery of embedded structures in hypercube computers,” Proc. Fifth Distributed Memory Computing Conf., pp. 1,4261,435, Apr. 1990.
[15] S. Nugent, "The iPSC/2 DirectConnect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 5160, Jan. 1998.
[16] S. Park and B. Bose, "Broadcasting in Hypercubes with Link/Node Failures," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 286290, 1992.
[17] M. Peercy and P. Banerjee, "Distributed Algorithms for ShortestPath, DeadlockFree Routing and Broadcasting in Arbitrarily Faulty Hypercubes," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 218225, June 1990.
[18] F.J. Provost and R. Melhem,“Distributed fault tolerant embedding of binary trees and rings inhypercubes,” Proc. Int’l Workshop Defect and Fault Tolerance in VLSI Systems, 1988.
[19] C.S. Raghavendra and M.A. Sridhar, "Broadcasting Algorithms in Faulty SIMD Hypercubes," Proc. Fourth IEEE Symp. Parallel and Distributed Processing, pp. 411, Dec. 1992.
[20] C.S. Raghavendra and M.A. Sridhar,“Faulttolerant routing algorithms in hypercube multiprocessors,” Proc. Fourth ISMM Int’l Conf. Parallel and Distributed ComputingSystems.
[21] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,657, Dec. 1988.
[22] D.A. Rennels,“On implementing fault tolerance in binary hypercubes,” Proc. 16th Int’l Symp. FaultTolerant Computing, pp. 344349, 1986.
[23] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[24] 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.
[25] P.J. Yang,S.B. Tien,, and C.S. Raghavendra,“Reconfiguration of rings and meshes in faulty hypercubes,” technical report, Dept. of Elec. Eng., Univ. of Southern Calif., 1991.
[26] P.J. Yang, S.B. Tien, and C.S. Raghavendra, “Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions,” IEEE Trans. Computers, vol. 43, no. 5, pp. 608613, May 1994.
[27] P.J. Yang,S.B. Tien,, and C.S. Raghavendra,“Embedding of multidimensional meshes on to faulty hypercubes,” Int’l Conf. Parallel Processing, pp. I571I574, 1991.
[28] P.J. Yang and C.S. Raghavendra,“Embedding and reconfiguration of binary trees in faulty hypercubes” Int’l Parallel Processing Symp., Mar. 1992.