Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Ring embedding in faulty honeycomb rectangular torus
Information Processing Letters
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm for constructing Hamiltonian paths in meshes
Parallel Computing
Information Processing Letters
Generalized honeycomb torus is hamiltonian
Information Processing Letters
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
A survey of research and practices of Network-on-chip
ACM Computing Surveys (CSUR)
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
Region-based routing: a mechanism to support efficient routing algorithms in NoCs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori
Computers and Electrical Engineering
Explorations of Honeycomb Topologies for Network-on-Chip
NPC '09 Proceedings of the 2009 Sixth IFIP International Conference on Network and Parallel Computing
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Adaptive and deadlock-free tree-based multicast routing for networks-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Centralized Adaptive Routing for NoCs
IEEE Computer Architecture Letters
A generic adaptive path-based routing method for MPSoCs
Journal of Systems Architecture: the EUROMICRO Journal
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Information Sciences: an International Journal
Theoretical Computer Science
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults
Theoretical Computer Science
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Hamiltonian cycles in hypercubes with 2n-4 faulty edges
Information Sciences: an International Journal
Hamiltonian Embedding in Crossed Cubes with Failed Links
IEEE Transactions on Parallel and Distributed Systems
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 0.07 |
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.