Hamiltonian properties of honeycomb meshes

Meshes are widely used topologies for Networks on Chip (NoC). Honeycomb meshes have better topological properties than Meshes. In order to communicate efficiently in a linear or cyclic manner, it is benefited that there is a Hamiltonian path or Hamiltonian cycle in NoC. In this paper, we give a necessary and sufficient condition for the existence of Hamiltonian path between any pair of vertices in a honeycomb mesh and for the existence of Hamiltonian path in a honeycomb mesh with one faulty vertex. Besides, we give a systematic method to construct a Hamiltonian path in Honeycomb meshes.

[1]  Hong Shen,et al.  An efficient algorithm for constructing Hamiltonian paths in meshes , 2002, Parallel Comput..

[2]  Xiaohua Jia,et al.  Edge-pancyclicity and path-embeddability of bijective connection graphs , 2008, Inf. Sci..

[3]  Xiaohua Jia,et al.  An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges , 2011, Theor. Comput. Sci..

[4]  Alexander Wei Yin,et al.  Explorations of Honeycomb Topologies for Network-on-Chip , 2009, 2009 Sixth IFIP International Conference on Network and Parallel Computing.

[5]  Sun-Yuan Hsieh,et al.  Conditional edge-fault Hamiltonicity of augmented cubes , 2010, Inf. Sci..

[6]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[7]  Hong-Jian Lai,et al.  Generalized honeycomb torus is Hamiltonian , 2004, Inf. Process. Lett..

[8]  Hannu Tenhunen,et al.  A generic adaptive path-based routing method for MPSoCs , 2011, J. Syst. Archit..

[9]  Ming-Chien Yang,et al.  Conditional diagnosability of matching composition networks under the MM∗ model , 2013, Inf. Sci..

[10]  Yi Pan,et al.  Optimal fault-tolerant embedding of paths in twisted cubes , 2007, J. Parallel Distributed Comput..

[11]  Tobias Bjerregaard,et al.  A survey of research and practices of Network-on-chip , 2006, CSUR.

[12]  Jun-Ming Xu,et al.  Fault-tolerant edge-pancyclicity of locally twisted cubes , 2011, Inf. Sci..

[13]  Jung-Sheng Fu,et al.  Fault-free Hamiltonian cycles in crossed cubes with conditional link faults , 2007, Inf. Sci..

[14]  Andrzej Szepietowski.  Hamiltonian cycles in hypercubes with 2n-4 faulty edges , 2012, Inf. Sci..

[15]  Mei Lu,et al.  Edge fault tolerance of super edge connectivity for three families of interconnection networks , 2012, Inf. Sci..

[16]  Xiaofan Yang,et al.  Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori , 2009, Comput. Electr. Eng..

[17]  Pao-Lien Lai.  Geodesic pancyclicity of twisted cubes , 2011, Inf. Sci..

[18]  Jun Luo,et al.  Fault-tolerant Hamiltonicity in a class of faulty meshes , 2006, Appl. Math. Comput..

[19]  Avinoam Kolodny,et al.  Centralized Adaptive Routing for NoCs , 2010, IEEE Computer Architecture Letters.

[20]  Yi-Ping Hung,et al.  Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model , 2009, J. Syst. Archit..

[21]  Jheng-Cheng Chen,et al.  Conditional edge-fault-tolerant Hamiltonicity of dual-cubes , 2011, Inf. Sci..

[22]  Behrooz Parhami,et al.  A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[23]  Li-Yen Hsu,et al.  Generalized honeycomb torus , 2003, Inf. Process. Lett..

[24]  Jing Li,et al.  Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube , 2011, Inf. Sci..

[25]  David Blaauw,et al.  A Reliable Routing Architecture and Algorithm for NoCs , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[26]  José Duato,et al.  Region-Based Routing: A Mechanism to Support Efficient Routing Algorithms in NoCs , 2009 .

[27]  Xin Liu,et al.  Efficient unicast in bijective connection networks with the restricted faulty node set , 2011, Inf. Sci..

[28]  Chih-Ping Chu,et al.  Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model , 2005, J. Syst. Archit..

[29]  Xiaohua Jia,et al.  Embedding of Cycles in Twisted Cubes with Edge-Pancyclic , 2008, Algorithmica.

[30]  Zhenyu He,et al.  Optimal doublecast path in hexagonal honeycomb mesh , 2006, Appl. Math. Comput..

[31]  Hamid Sarbazi-Azad,et al.  The triangular pyramid: Routing and topological properties , 2010, Inf. Sci..

[32]  Li-Yen Hsu,et al.  Ring embedding in faulty honeycomb rectangular torus , 2002, Inf. Process. Lett..

[33]  Yuxing Yang,et al.  Conditional connectivity of star graph networks under embedding restriction , 2012, Inf. Sci..

[34]  P. McKinley,et al.  Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers , 1992 .

[35]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[36]  Ruo-Wei Hung,et al.  Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes , 2011, Theor. Comput. Sci..

[37]  Kenli Li,et al.  One-to-one communication in twisted cubes under restricted connectivity , 2010, Frontiers of Computer Science in China.

[38]  Shiying Wang,et al.  Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults , 2011, Theor. Comput. Sci..

[39]  Manfred Glesner,et al.  Adaptive and Deadlock-Free Tree-Based Multicast Routing for Networks-on-Chip , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[40]  Dajin Wang.  Hamiltonian Embedding in Crossed Cubes with Failed Links , 2012, IEEE Transactions on Parallel and Distributed Systems.