Routing algorithms in honeycomb meshes

DOI10.1080/17445760802561437zbMath1192.68089OpenAlexW2058246311MaRDI QIDQ3645052

Xiaofan Yang, Zhi Huang, Yan Liang, Weiwen Zhang

Publication date: 16 November 2009

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760802561437

zbMATH Keywords

fault tolerancemulticastunicasthoneycomb mesheswormhole-routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer system organization (68M99) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Generalized honeycomb torus is Hamiltonian
• Optimal doublecast path in hexagonal honeycomb mesh
• On minimum metric dimension of honeycomb networks
• Generalized honeycomb torus
• Honeycomb tori are Hamiltonian
• The diameter of honeycomb rhombic tori.
• The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: Routing algorithms in honeycomb meshes