
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
FengShr Jiang, ShiJinn Horng, TzongWann Kao, "Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 7, pp. 727737, July, 1997.  
BibTex  x  
@article{ 10.1109/71.598347, author = {FengShr Jiang and ShiJinn Horng and TzongWann Kao}, title = {Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {7}, issn = {10459219}, year = {1997}, pages = {727737}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.598347}, 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 of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes IS  7 SN  10459219 SP727 EP737 EPD  727737 A1  FengShr Jiang, A1  ShiJinn Horng, A1  TzongWann Kao, PY  1997 KW  Direct embedding KW  faulttolerant KW  generalized Fibonacci cubes KW  hypercubes KW  faulty hypercube KW  secondorder Fibonacci cube. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The
[1] W.J. Hsu, "Fibonacci Cubes—A New Interconnection Topology," IEEE Trans. Parallel and Distributed Systems, vol 4, no.1, pp. 312, Jan. 1993.
[2] J. Liu and W.J. Hsu, "Distributed Algorithms for ShortestPath, DeadlockFree Routing and Broadcasting in Fibonacci Cubes," Proc. 11th Phoenix Conf. Computers and Comm., pp. 2330, 1992.
[3] J. Liu and W.J. Hsu, "Distributed Algorithms for ShortestPath, DeadlockFree Routing and Broadcasting in a Class of Interconnection Topologies," Proc. Sixth Int'l Parallel Processing Symp., pp. 589596, Mar. 1992.
[4] W.J. Hsu and M.J. Chung, "Generalized Fibonacci Cubes," Proc. 1993 Int'l Conf. Parallel Processing, vol. I, pp. 299302, 1993.
[5] W.J. Hsu, C.V. Page, and J.S. Liu, "Computing Prefixes on a Large Family of Interconnection Topologies," Proc. 1992 Int'l Conf. Parallel Processing, vol. 3, pp.153159, 1992.
[6] B. Cong, S.Q. Zheng, and S. Sharma, "On Simulatons of Linear Arrays, Rings and 2D Meshes on Fibonacci Cube Networks," Proc. Seventh Int'l Parallel Processing Symp., pp. 748751, Apr. 1993.
[7] W.J. Hsu, "Embedding Mesh in a Large Family of Graphs," Parallel Processing Letters, vol. 2, no. 23, pp. 149155, 1992.
[8] 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.
[9] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[10] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. AddisonWesley, 1973.
[11] W.J. Hsu and J. Liu, "Fibonacci Codes as Formal Languages," Technical Report CPS9105, Michigan State Univ., May 1991.
[12] P.S. Bruckman, "The Generalized Zeckendorf Theorems," Fibonacci Quarterly, vol. 27, pp. 338347, 1989.
[13] S. Latifi, S. Zheng, and N. Bagherzadeh, "Optimal Ring Embedding in Hypercubes with Faulty Links," Proc. FaultTolerant Computing Symp., pp. 178184, 1992.
[14] J. Liu and B.M. McMillin, "A Divide and Conquer Ring Embedding Scheme in Hypercubes with Efficient Recovery Ability," Proc. 1992 Int'l Conf. Parallel Processing, vol. 3, pp. 3845, 1992.
[15] F.S. Jiang, S.J. Horng, and T.W. Kao, "Embedding Fibonacci Cubes on Faulty Hypercubes," Technical Report TR1994EE002, Nat'l Taiwan Inst. of Tech nology, July, 1994.