The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2009 vol.20)
pp: 581-592
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
Chia-Wei Lee , National Cheng Kung University, Tainan
ABSTRACT
A graph $G$ is called Hamiltonian if there is a Hamiltonian cycle in $G$. The conditional edge-fault Hamiltonicity of a Hamiltonian graph $G$ is the largest $k$ such that after removing $k$ faulty edges from $G$, provided that each node is incident to at least two fault-free edges, the resulting graph contains a Hamiltonian cycle. In this paper, we sketch common properties of a class of networks, called Matching Composition Networks (MCNs), such that the conditional edge-fault Hamiltonicity of MCNs can be determined from the found properties. We then apply our technical theorems to determine conditional edge-fault Hamiltonicities of several multiprocessor systems, including $n$-dimensional crossed cubes, $n$-dimensional twisted cubes, $n$-dimensional locally twisted cubes, $n$-dimensional generalized twisted cubes, and $n$-dimensional hyper Petersen networks. Moreover, we also demonstrate that our technical theorems can be applied to network construction.
INDEX TERMS
Graph Theory, Network problems, Path and circuit problems
CITATION
Sun-Yuan Hsieh, Chia-Wei Lee, "Conditional Edge-Fault Hamiltonicity of Matching Composition Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 4, pp. 581-592, April 2009, doi:10.1109/TPDS.2008.123
REFERENCES
[1] S.G. Akl, Parallel Computation: Models and Methods. Prentice Hall, 1997.
[2] N. Ascheuer, “Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems,” PhD thesis, Univ. of Technology, ftp://ftp.zib.de/pub/zib-publications/reports TR-96-03.ps, 1995.
[3] Y.A. Ashir and I.A. Stwart, “Fault-Tolerant Embeddings of Hamiltonian Circuits in $k\hbox{-}{\rm Ary}\;n\hbox{-}{\rm Cubes}$ ,” SIAM J. Discrete Math., vol. 15, no. 3, pp. 317-328, 2002.
[4] M.Y. Chang and S.J. Lee, “On the Existence of Hamiltonian Circuits in Faulty Hypercubes,” SIAM J. Discrete Math., vol. 4, no. 4, pp. 511-527, 1991.
[5] F.B. Chedid, “On the Generalized Twisted Cube,” Information Processing Letters, vol. 55, no. 1, pp. 49-52, 1995.
[6] S.K. Das and A.K. Banerjee, “Hyper Petersen Network: Yet Another Hypercube-Like Topology,” Proc. Fourth Symp. Frontiers of Massively Parallel Computation (Frontiers '92), pp. 270-277, 1992.
[7] K. Efe, “The Crossed Cube Architecture for Parallel Computation,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp.513-524, Sept.-Oct. 1992.
[8] J.-S. Fu, “Fault-Tolerant Cycle Embedding in the Hypercube,” Parallel Computing, vol. 29, no. 6, pp. 821-832, 2003.
[9] J.-S. Fu, “Conditional Fault-Tolerant Hamiltonicity of Star Graphs,” Parallel Computing, vol. 33, no. 7-8, pp. 488-496, 2007.
[10] J.-S. Fu, “Fault-Free Hamiltonian Cycles in Twisted Cubes with Conditional Link Faults,” Theoretical Computer Science, in press.
[11] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,” Proc. Conf. Parallel Architectures and Languages Europe, Volume I: Parallel Architectures (PARLE '87), pp.152-159, 1987.
[12] T.-Y. Ho, J.J.M. Tan, and L.-H. Hsu, “Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of the Folded Petersen Cube Networks,” Int'l J. Computer Math., accepted.
[13] S.-Y. Hsieh, C.-W. Ho, and G.-H. Chen, “Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 223-237, Mar. 1999.
[14] S.-Y. Hsieh, G.-H. Chen, and C.-W. Ho, “Longest Fault-Free Paths in Star Graphs with Edge Faults,” IEEE Trans. Computers, vol. 50, no. 9, pp. 960-971, Sept. 2001.
[15] S.-Y. Hsieh and C.-D. Wu, “Conditional Edge-Fault-Tolerant Hamiltonian Cycle Embedding of Star Graphs,” Proc. 13th Int'l Conf. Parallel and Distributed Systems (ICPADS), 2007.
[16] S.-Y. Hsieh and C.-Y. Wu, “Edge-Fault-Tolerant Hamiltonicity of Locally Twisted Cubes under Conditional Edge Faults,” J.Combinatorial Optimization, in press.
[17] H.S. Hung, G.H. Chen, and J.S. Fu, “Fault-Free Hamiltonian Cycles in Crossed Cubes with Conditional Link Faults,” Information Sciences, vol. 177, no. 24, pp. 5664-5674, 2007.
[18] P.L. Lai and H.C. Hsu, “The Two-Equal-Disjoint Path Cover Problem of Matching Composition Network,” Information Processing Letters, to appear.
[19] P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu, “Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 53, no. 8, pp.1064-1069, Aug. 2004.
[20] F.T. Leighton, Introduction to Parallel Algorithms and Architecture: Arrays $\cdot$ Trees $\cdot$ Hypercubes. Morgan Kaufmann, 1992.
[21] J.-H. Park and K.-Y. Chwa, “Recursive Circulant: A New Topology for Multicomputer Networks,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '94), pp. 73-80, 1994.
[22] J.-H. Park, H.-C. Kim, and H.-S. Lim, “Fault-Hamiltonicity of Hypercube-Like Interconnection Networks,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.
[23] J.-H. Park, H.-C. Kim, and H.-S. Lim, “On the Construction of Paired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements,” Proc. 10th Workshop Advances in Parallel and Distributed Computational Models (APDCM '08), to be presented, Apr. 2008.
[24] J.-H. Park, H.-S. Lim, and H.-C. Kim, “Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements,” Theoretical Computer Science, vol. 377, pp. 170-180, 2007.
[25] C.-H. Tsai, “Linear Array and Ring Embeddings in Conditional Faulty Hypercubes,” Theoretical Computer Science, vol. 314, pp.431-443, 2004.
[26] Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu, “Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1185-1195, Dec. 1997.
[27] A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, “A Class of Hypercube-Like Networks,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing (SPDP '93), pp. 800-803, Dec. 1993.
[28] N.-C. Wang, C.-P. Chu, and T.-S. Chen, “A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks,” J. Parallel and Distributed Computing, vol. 62, no. 12, pp. 1747-1762, 2002.
[29] N.-C. Wang, C.-P. Yan, and C.-P. Chu, “Multicast Communication in Wormhole-Routed Symmetric Networks with Hamiltonian Cycle Model,” J. Systems Architecture, vol. 51, no. 3, pp. 165-183, 2005.
[30] X. Yang, D.J. Evans, and G.M. Megson, “The Locally Twisted Cubes,” Int'l J. Computer Math., vol. 82, no. 4, pp. 401-413, 2005.
477 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool