DOI QR코드

DOI QR Code

Edge Fault Hamiltonian Properties of Mesh Networks with Two Additional Links

메쉬에 두 개의 링크를 추가한 연결망의 에지 고장 해밀톤 성질

  • 박경욱 (전남대학교 대학원 전산학과) ;
  • 임형석 (전남대학교 전산학과)
  • Published : 2004.06.01

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.

본 논문에서는 m${\times}$n 메쉬 연결망의 첫 행과 마지막 행에 랩어라운드 링크를 갖는 연결망 M$_2$(m,n) (m$\geq$2, n$\geq$3)의 고장 해밀톤 성질을 고려한다. 이분 그래프인 M$_2$(m,n)에 하나의 결함 링크가 발생했을 때 임의의 두 노드가 다른(같은) 집합에 속한 경우 두 노드를 잇는 길이 mn-1(mn-2)인 경로가 존재함을 보인다. [1]에서 보인 P$_{m}$ ${\times}$C$_{n}$ 의 연구 결과와 비교하면 P$_{m}$ ${\times}$C$_{n}$ 또한 이러한 해밀톤 성질을 지닌다. 그러나 P$_{m}$ ${\times}$C$_{n}$ 이 m개의 랩어라운드 에지를 지니는 것에 반해 M$_2$(m,n)은 단지 두 개의 링크를 추가하여 이러한 해밀톤 성질을 지닌다. 또한 M$_2$(m,n)은 다차원 메쉬, 재귀원형군, 하이퍼큐브, 이중 루프 네트워크, k-ary n-큐브와 같은 여러 상호 연결망의 스패닝 부 그래프이다. 따라서 M$_2$(m,n)의 고장 해밀톤 성질은 이들 연결망들의 고장 해밀톤들 성질을 밝히는데 활용될 수 있다. 본 논문의 결과를 3차원 메쉬, 재귀원형군, 하이퍼큐브에 적용시켜 이들 연결망의 고장 해밀톤 성질들을 보인다.

Keywords

References

  1. 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
  2. Intel Corporation literature, Intel Corporation, 1991
  3. F. T. Leighton, 'Introduction to Parallel Algorithms and Architectures Arrays, Trees,' Hypercubes, San Mateo, Calif. : Morgan-Kaufmann, 1992
  4. 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 https://doi.org/10.1109/SFCS.1992.267797
  5. V. Balasubramanian and P. Banerjee, 'A fault tolerant massively parallel processing architecture,' Journal of Parallel and Distributed Computing, Vol.4, pp.363-383, 1987 https://doi.org/10.1016/0743-7315(87)90025-6
  6. 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 https://doi.org/10.1109/SFCS.1992.267781
  7. J. Bruck, R. Cypher and C. Ho, 'Fault-tolerant meshes with small degree,' SIAM J. Computing, Vol.26, No.6, pp.1764-1784, 1997 https://doi.org/10.1137/S0097539794274994
  8. L. Zhang, 'Fault-tolerant meshes with small degree,' IEEE Transactions on Computers, Vol.51, No.5, pp.553-560, 2002 https://doi.org/10.1109/TC.2002.1004594
  9. 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 https://doi.org/10.1016/S0020-0190(02)00214-4
  10. 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
  11. 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 https://doi.org/10.1137/S0895480196311183
  12. 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
  13. G. Simmons, 'Almost all n-dimensional rectangular lattices are Hamiltonian laceable,' Congr. Numer., Vol. 21, pp.103-108, 1978
  14. S. Y. Hsieh, G. H. Chen and C. W. Ho, 'Hamiltonian-laceability of star graphs,' Networks, Vol.36, No.4, pp.225-232, 2000 https://doi.org/10.1002/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G
  15. 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 https://doi.org/10.1007/BFb0091805
  16. 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 https://doi.org/10.1016/S0167-8191(02)00135-7
  17. 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 https://doi.org/10.1137/0211056
  18. 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 https://doi.org/10.1109/71.995821
  19. 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 https://doi.org/10.1016/S1383-7621(96)00120-8
  20. 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
  21. 박경욱, 이형옥, 임형석, '두 개의 랩어라운드 에지를 갖는 메쉬의 고장 해밀톤 성질', 한국정보과학회논문지, Vol.30, No.8, pp.434-444, 2003
  22. C. -H. Tsai, 'Hamitonian properties of faulty recursive circulant graphs,' Journal of Interconnection Networks, Vol.3, No.3&4, pp.273-289, 2002 https://doi.org/10.1142/S0219265902000677
  23. 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 https://doi.org/10.1109/FTCS.1992.243602
  24. 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