Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2004.11A.3.189

Edge Fault Hamiltonian Properties of Mesh Networks with Two Additional Links  

Park, Kyoung-Wook (전남대학교 대학원 전산학과)
Lim, Hyeong-Seok (전남대학교 전산학과)
Abstract
We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.
Keywords
Mesh; Interconnection Networks; Hamiltonian Path; Fault Hamiltonian Path; Strongly Hamiltonian Laceable;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Y. A. Ashir and I. A. Stewart, 'Fault-tolerant embeddings of hamiltonian circuits in k-ary n-cubes,' SIAM Journal on Discrete mathematics, Vol.15, No.3, pp.317-328, 2002   DOI   ScienceOn
2 J. S. Kim, S. R. Maeng and H. Yoon, 'Embedding of rings in 2-D meshes and tori with faulty nodes,' Journal of Systems Architecture, Vol.43, pp.643-654, 1997   DOI   ScienceOn
3 H. C. Kim and J. H. Park, 'Fault hamiltonicity of two-dimensional torus networks,' Workshop on Algorithms and Computation (WAAC'00), pp.110-117, 2000
4 V. Balasubramanian and P. Banerjee, 'A fault tolerant massively parallel processing architecture,' Journal of Parallel and Distributed Computing, Vol.4, pp.363-383, 1987   DOI   ScienceOn
5 M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. T. Ho, M. Naor and E. Szemeredi, 'Fault tolerant graphs, perfect hash functions and disjoint paths,' Proc. IEEE Symp. Foundations of Computer Science, pp.693-702, 1992   DOI
6 J. Bruck, R. Cypher and C. Ho, 'Fault-tolerant meshes with small degree,' SIAM J. Computing, Vol.26, No.6, pp.1764-1784, 1997   DOI   ScienceOn
7 L. Zhang, 'Fault-tolerant meshes with small degree,' IEEE Transactions on Computers, Vol.51, No.5, pp.553-560, 2002   DOI   ScienceOn
8 C.-H. Tsai, J. M. Tan, T. Lian and L.-H. Hsu, 'Fault-tolerant hamiltonian laceability of hypercubes,' Information Processing Letters, No.83, pp.301-306, 2002   DOI   ScienceOn
9 C.-H. Tsai, J. M. Tan, Y. C. Chuang and L.-H. Hsu, 'Fault-free cycles and links in faulty recursive circulant graphs,' Proc. of the ICS 2000 Workshop on Algorithms and Theory of Computation, pp.74-77, 2000
10 W. T. Huang, Y. C. Chuang, J. J. Tan and L. H. Hsu, 'On the fault-tolerant hamiltonicity of faulty crossed cubes,' IEICE Trans. Fundamentals, Vol.E85-A, No.6, pp.1359-1370, 2002
11 G. Simmons, 'Almost all n-dimensional rectangular lattices are Hamiltonian laceable,' Congr. Numer., Vol. 21, pp.103-108, 1978
12 S. Y. Hsieh, G. H. Chen and C. W. Ho, 'Hamiltonian-laceability of star graphs,' Networks, Vol.36, No.4, pp.225-232, 2000   DOI   ScienceOn
13 C. C. Chen and N. F. Quimpo, 'On strongly hamiltonian abelian group graphs,' Combinatorial Mathematics VIII. Lecture Notes in Mathematics, Vol.884, pp.23-34, 1980   DOI
14 S. D. Chen, H. Shen and R. W. Topor, 'An efficient algorithm for constructing hamiltonian paths in meshes,' Parallel Computing, Vol.28, pp.1293-1305, 2002   DOI   ScienceOn
15 A. Itai, C. H. Papadimitriou and J. L. Czwarcfiter, 'Hamiltonian paths in grid graphs,' SIAM Journal of Computing, Vol.11, No.4, pp.676-686, 1982   DOI
16 S. D. Chen, H. Shen and R. W.Topor, 'Permutation-based range-join algorithms on N-dimensional meshes,' IEEE Transactions on Parallel and Distributed Systems, Vol.13, No.4, pp.413-431, 2002   DOI   ScienceOn
17 S. Latifi, S. Q. Zheng and N. Bagherzadeh, 'Hamiltonian path and cycle in hypercuhes with faulty links,' Proc. International Conference on Algorithms and Architectures for Parallel Processing(ICA3PP'02), pp.471-478, 2002
18 박경욱, 이형옥, 임형석, '두 개의 랩어라운드 에지를 갖는 메쉬의 고장 해밀톤 성질', 한국정보과학회논문지, Vol.30, No.8, pp.434-444, 2003   과학기술학회마을
19 C. -H. Tsai, 'Hamitonian properties of faulty recursive circulant graphs,' Journal of Interconnection Networks, Vol.3, No.3&4, pp.273-289, 2002   DOI   ScienceOn
20 S. Latifi, S. Q. Zheng and N. Bagherzadeh, 'Optimal ring embedding in hypercubes with faulty links,' Proc. International Symposium on Fault-Tolerant Computing(FTCS '92), pp.178-184, 1992   DOI
21 T. Leighton, B. Maggs and R. Sitaraman, 'On the fault tolerance of some popular bounded-degree networks,' Proc. IEEE Symp. Foundations of Computer Science, pp.542-552, 1992   DOI
22 J. H. Park and H. C. Kim, 'Fault hamiltonicity of product graph of path and cycle,' International Conference, Computing and Combinatorics Conference (COCOON), pp.319-328, 2003
23 Intel Corporation literature, Intel Corporation, 1991
24 F. T. Leighton, 'Introduction to Parallel Algorithms and Architectures Arrays, Trees,' Hypercubes, San Mateo, Calif. : Morgan-Kaufmann, 1992