
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JungSheng Fu, "Hamiltonicity of the WKRecursive Network with and without Faulty Nodes," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 9, pp. 853865, September, 2005.  
BibTex  x  
@article{ 10.1109/TPDS.2005.109, author = {JungSheng Fu}, title = {Hamiltonicity of the WKRecursive Network with and without Faulty Nodes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {16}, number = {9}, issn = {10459219}, year = {2005}, pages = {853865}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.109}, 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  Hamiltonicity of the WKRecursive Network with and without Faulty Nodes IS  9 SN  10459219 SP853 EP865 EPD  853865 A1  JungSheng Fu, PY  2005 KW  WKrecursive KW  embedding KW  Hamiltonianconnected KW  interconnection network KW  faulttolerant embedding KW  Hamiltonian cycle. VL  16 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Recently, the WKrecursive network has received much attention due to its many favorable properties such as a high degree of scalability. By
[1] S.G. Akl, Parallel Computation: Models and Methods. Upper Saddle River, N.J.: PrenticeHall, 1997.
[2] N. Ascheuer, “Hamiltonian Path Problems in the OnLine Optimization of Flexible Manufacturing Systems,” PhD thesis, Univ. of Technology, Berlin, Germany, ftp://ftp.zib.de/pub/zibpublications/reports TR9603.ps, 1995.
[3] F. Buckley and F. Harary, Distance in Graphs. Reading, Mass.: AddissonWesley, 1990.
[4] G.H. Chen and D.R. Duh, “Topological Properties, Communication, and Computation on WKRecursive Networks,” Networks, vol. 24, no. 6, pp. 303317, 1994.
[5] G. Della Vecchia and R. Distasi, “BTree Triangular Coding on WKRecursive Networks,” Parallel Computing: StateoftheArt and Perspectives, Proc. Conf. (ParCo '95), Sept. 1995.
[6] G. Della Vecchia and C. Sanges, “A Recursively Scalable Network VLSI Implementation,” Future Generation Computer Systems, vol. 4, no. 3, pp. 235243, 1988.
[7] G. Della Vecchia and C. Sanges, “Recursively Scalable Networks for Message Passing Architectures,” Parallel Processing and Applications, E. Chiricozzi and A. D'Amico, eds., pp. 3340, Amsterdam: Elsevier NorthHolland, 1988.
[8] G. Della Vecchia and C. Sanges, “An Optimized Broadcasting Technique for WKRecursive Topologies,” Future Generation Computer Systems, vol. 5, no. 3, pp. 353357, 1989/1990.
[9] D.R. Duh and G.H. Chen, “Topological Properties of WKRecursive Networks,” J. Parallel and Distributed Computing, vol. 23, no. 3, pp. 468474, 1994.
[10] R. Fernandes, D.K. Friesen, and A. Kanevsky, “Efficient Routing and Broadcasting in Recursive Interconnection Networks,” Proc. 23rd Int'l Conf. Parallel Processing. Volume 1: Architecture, pp. 5158, 1994.
[11] R. Fernandes, D.K. Friesen, and A. Kanevsky, “Embedding Rings in Recursive Networks,” Proc. Sixth Symp. Parallel and Distributed Processing, pp. 273280, 1994.
[12] R. Fernandes and A. Kanevsky, “Substructure Allocation in Recursive Interconnection Networks,” Proc. 1993 Int'l Conf. Parallel Processing. Volume 1: Architecture, pp. 319323, 1993.
[13] J.S. Fu and G.H. Chen, “Hamiltonicity of the Hierarchical Cubic Network,” Theory of Computing Systems, vol. 35, no. 1, pp. 5979, 2002.
[14] J.S. Fu and G.H. Chen, “FaultTolerant Cycle Embedding in Hierarchical Cubic Networks,” Networks, vol. 43, no. 1, pp. 2838, 2004.
[15] J.S. Fu, “FaultTolerant Cycle Embedding in the Hypercube,” Parallel Computing, vol. 29, no. 6, pp. 821832, 2003.
[16] F. Harary and J.P. Hayes, “Edge Fault Tolerance in Graphs,” Networks, vol. 23, pp. 135142, 1993.
[17] W.T. Huang, J.M. Tan, C.N. Hung, and L.H. Hsu, “FaultTolerant Hamiltonicity of Twisted Cubes,” J. Parallel and Distributed Computing, vol. 62, no. 4, pp. 591604, 2002.
[18] INMOS Limited, Transputer Reference Manual, Upper Saddle River, N.J.: PrenticeHall, 1988.
[19] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes. San Mateo: Morgan Kaufman, 1992.
[20] S.C. Liaw and G.J. Chang, “Generalized Diameters and Rabin Numbers of Networks,” J. Combinatorial Optimization, vol. 2, no. 4, pp. 371384, 1999.
[21] C. Sanges and U. Scafuri, “Virtual Node Communication on WKNetworks,” Parallel Computing: StateoftheArt and Perspectives, Proc. Conf. (ParCo '95), Sept. 1995.
[22] M.Y. Su, G.H. Chen, and D.R. Duh, “A Shortest Path Routing Algorithm for Incomplete WKRecursive Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 367379, Apr. 1997.
[23] M.Y. Su, G.H. Chen, and D.R. Duh, “Topological Properties of Incomplete WKRecursive Networks,” Networks, vol. 32, no. 1, pp. 2345, 1998.
[24] M.Y. Su, G.H. Chen, and D.R. Duh, “Broadcasting on Incomplete WKRecursive Networks,” J. Parallel and Distributed Computing, vol. 57, no. 3, pp. 271294, 1999.
[25] M.Y. Su, H.L. Huang, G.H. Chen, and D.R. Duh, “NodeDisjoint Paths in Incomplete WKRecursive Networks,” Parallel Computing, vol. 26, nos. 1314, pp. 19251944, 2000.
[26] L. Verdoscia and U. Scafuri, “CODACS Project: LevelNode Communication Policies,” Proc. 11th Euromicro Conf. Parallel, Distributed and NetworkBased Processing, pp. 134139, 2003.
[27] L. Verdoscia and R. Vaccaro, “An Adaptive Routing Algorithm for WKRecursive Topologies,” Computing, vol. 63, no. 2, pp. 171184, 1999.