
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, "Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 237245, March, 1996.  
BibTex  x  
@article{ 10.1109/71.491577, author = {PeiJi Yang and C.s. Raghavendra}, title = {Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {3}, issn = {10459219}, year = {1996}, pages = {237245}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.491577}, 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  Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes IS  3 SN  10459219 SP237 EP245 EPD  237245 A1  PeiJi Yang, A1  C.s. Raghavendra, PY  1996 KW  Fault tolerance KW  hypercube KW  binary tree KW  embedding KW  free dimension. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We consider the problem of embedding and reconfiguring binary tree structures in faulty hypercubes. We assume that the number of faulty nodes is at most (
[1] P. Banerjee, "Strategies for Reconfiguring Hypercubes Under Faults," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 210217, June 1990.
[2] S.N. Bhatt and I.C.F. Ipsen, "How to Embed Trees in Hypercubes," Yale Unive. Research Report RR443, 1985.
[3] J. Bruck, R. Cypher, and D. Soroker, "Running Algorithms Efficiently on Faulty Hypercubes," Computer Architecture News, vol. 19, no. 1, pp. 8996, Mar. 1991.
[4] J. Bruck, R. Cypher, and C.T. Ho, "Wildcard Dimensions, Coding Theory and FaultTolerant Meshes and Hypercubes," Proc. 23rd Int'l Symp. FaultTolerant Computing, pp. 260267, June 1993.
[5] 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.
[6] M.Y. Chan and S.J. Lee, "Fault Tolerant Embedding of Complete Binary Trees and Rings in Hypercubes," Univ. of Texas at Dallas, Technical Report UTDCS1789, Aug. 1898.
[7] S.R. Deshpande and R.M. Jenevein, "Scalability of a Binary Tree on a Hypercube," Int'l Conf. Parallel Processing, pp. 661668, 1986.
[8] S. Dutt and J.P. Hayes, "An Automorphic Approach to the Design of FaultTolerant Multiprocessors," Proc. 19th Fault Tolerant Computing Symp., pp. 496503,Chicago, June 1989.
[9] J. Hastad, T. Leighton, and M. Newman, "Reconfiguring a Hypercube in the Presence of Faults," ACM Theory of Computing, pp. 274284, 1987.
[10] T.H. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer Science Press, 1978.
[11] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133172, 1987.
[12] T.C. Lee, "Quick Recovery of Embedded Structures in Hypercube Computers," Proc. Fifth Distributed Memory Computing Conf., pp. 1,4261,435, Apr. 1990.
[13] D. Nassimi and S. Sahni, "Optimal BPC Permutations on a Cube Connected SIMD Computer," IEEE Trans. Computers, pp. 338341, Apr. 1982.
[14] S. Nugent, "The iPSC/2 DirectConnect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 5160, Jan. 1998.
[15] F.J. Provost and R. Melhem, "Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes," Proc. Int'l Workshop Defect and Fault Tolerance in VLSI Systems, 1988.
[16] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,657, Dec. 1988.
[17] C.S. Raghavendra,P.J. Yang,, and S.B. Tien,“Free dimensions—an effective approach to achieving fault tolerance in hypercubes,” 22nd Ann. Int’l Symp. FaultTolerant Computing, pp. 170177, 1992.
[18] 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.
[19] D.A. Rennels, "On Implementing FaultTolerance in Binary Hypercubes," Proc.16th Int'l Symp. FaultTolerant Computing, pp. 344349, 1986.
[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, C.S. Raghavendra, and M.A. Sridhar, "Reconfiguration of Embedded Task Graphs in Faulty Hypercubes by Automorphisms," Hawaii Int'l Conf. System Science, pp. 91100, 1990.
[22] S.B. Tien and C.S. Raghavendra, "Optimal Global Operations and Broadcasting on Faulty Hypercubes," Technical Report, Dept. of Electrical Eng., Southern Illinois Univ., 1991.
[23] J.D. Ullman, Computational Aspects of VLSI. Computer Science Press, 1984.
[24] A.Y. Wu, "Embedding of Tree Networks into Hypercubes," J. Parallel and Distributed Computing, pp. 238249, 1985.
[25] P.J. Yang, S.B. Tien, and C.S. Raghavendra, "Embedding of Multidimensional Meshes on to Faulty Hypercubes," Int'l Conf. Parallel Processing, pp. 571574, 1991.
[26] P.J. Yang and C.S. Raghavendra, "Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes," Washington State Univ. Technical Report, 1994.