Hamiltonian connectivity of the WK-recursive network with faulty nodes

Information Sciences

Volumn 178, Issue 12, 2008, Pages 2573-2584

  Fu, Jung Sheng ^a  

^a NATIONAL UNITED UNIVERSITY   (Taiwan)

Author keywords

Fault tolerant embedding; Graph theoretic interconnection network; Hamiltonian connected; WK recursive

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; HAMILTONIANS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

FAULT-TOLERANT EMBEDDING; GRAPH-THEORETIC INTERCONNECTION NETWORKS; HAMILTONIAN-CONNECTED;

INTERCONNECTION NETWORKS;

EID: 41949139547     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.02.011     Document Type: Article

References (26)

1. Akl S.G. Parallel Computation: Models and Methods (1997), Prentice-Hall, Upper Saddle River, NJ
2. N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD Thesis, University of Technology, Berlin, Germany, 1995, .
3. Buckley F., and Harary F. Distance in Graphs (1990), Addison-Wesley, Reading, MA, USA
4. Chang J.M., Yang J.S., Wang Y.L., and Cheng Y. Panconnectivity, fault-tolerant Hamiltonicity and Hamiltonian-connectivity in alternating group graphs. Networks 44 4 (2004) 302-310
5. Chen G.H., and Duh D.R. Topological properties, communication, and computation on WK-recursive networks. Networks 24 6 (1994) 303-317
6. Della Vecchia G., and Sanges C. A recursively scalable network VLSI implementation. Future Generation Computer Systems 4 3 (1988) 235-243
7. Della Vecchia G., and Sanges C. Recursively scalable networks for message passing architectures. In: Chiricozzi E., and D'Amico A. (Eds). Parallel Processing and Applications (1988), Elsevier North-Holland, Amsterdam 33-40
8. Della Vecchia G., and Sanges C. An optimized broadcasting technique for WK-recursive topologies. Future Generation Computer Systems 5 3 (1989/1990) 353-357
9. Du D.R., Chen Y.C., and Wu R.Y. Proof that pyramid networks are 1-hamiltonian-connected with high probability. Information Science 177 19 (2007) 4188-4199
10. Duh D.R., and Chen G.H. Topological properties of WK-recursive networks. Journal of Parallel and Distributed Computing 23 3 (1994) 468-474
11. R. Fernandes, D.K. Friesen, A. Kanevsky, Efficient routing and broadcasting in recursive interconnection networks, in: Proceedings of the 23rd International Conference on Parallel Processing. Volume 1: Architecture, 1994, pp. 51-58.
12. R. Fernandes, D.K. Friesen, A. Kanevsky, Embedding rings in recursive networks, in: Proceedings of the 6th Symposium on Parallel and Distributed Processing, 1994, pp. 273-280.
13. Fu J.S. Hamiltonicity of the WK-recursive network with and without faulty nodes. IEEE Transactions on Parallel and Distributed Systems 16 9 (2005) 853-865
14. Fu J.S. Longest fault-free paths in hypercubes with vertex faults. Information Science 176 7 (2006) 759-771
15. Hsu H.C., Li T.K., Tan J.M., and Hsu L.H. Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs. IEEE Transactions on Computers 53 1 (2004) 39-53
16. INMOS Limited. Transputer Reference Manual (1988), Prentice-Hall, Upper Saddle River, NJ, USA pp. 315-324 (Includes index. Bibliography)
17. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufman, San Mateo
18. Liaw S.C., and Chang G.J. Generalized diameters and Rabin numbers of networks. Journal of Combinatorial Optimization 2 4 (1999) 371-384
19. Su M.Y., Chen G.H., and Duh D.R. A shortest path routing algorithm for incomplete WK-recursive networks. IEEE Transactions on Parallel and Distributed Systems 8 4 (1997) 367-379
20. Su M.Y., Chen G.H., and Duh D.R. Topological properties of incomplete WK-recursive networks. Networks 32 1 (1998) 23-45
21. Su M.Y., Chen G.H., and Duh D.R. Broadcasting on incomplete WK-recursive networks. Journal of Parallel and Distributed Computing 57 3 (1999) 271-294
22. Su M.Y., Huang H.L., Chen G.H., and Duh D.R. Node-disjoint paths in incomplete WK-recursive networks. Parallel Computing 26 13-14 (2000) 1925-1944
23. L. Verdoscia, U. Scafuri, CODACS project: level-node communication policies, in: Proceedings of the 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003, pp. 134-139.
24. Verdoscia L., and Vaccaro R. An adaptive routing algorithm for WK-recursive topologies. Computing 63 2 (1999) 171-184
25. West D.B. Introduction to Graph Theory. second ed. (2001), Prentice-Hall, Upper Saddle River
26. Yang M.C., Li T.K., Tan J.M., and Hsu L.H. On embedding cycles into faulty twisted cubes. Information Science 176 6 (2006) 676-690