Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
HARTS: A Distributed Real-Time Architecture
Computer - Special issue on real-time systems
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An Efficient Dictionary Machine Using Hexagonal Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
High-Performance Computing on a Honeycomb Architecture
Proceedings of the Second International ACPC Conference on Parallel Computation
On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays
Proceedings of the VLSI Algorithms and Architectures, Aegean Worksho on Computing
Sep: A Fixed Degree Regular Network for MassivelyParallel Systems
The Journal of Supercomputing
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Location management in cellular networks
Handbook of wireless networks and mobile computing
Ring embedding in faulty honeycomb rectangular torus
Information Processing Letters
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing
Generalized honeycomb torus is hamiltonian
Information Processing Letters
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing
A Group Construction Method with Applications to Deriving Pruned Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
Discrete Applied Mathematics
The globally Bi-3*-connected property of the honeycomb rectangular torus
Information Sciences: an International Journal
Journal of Computer and System Sciences
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
Topology control with Hexagonal Tessellation
International Journal of Sensor Networks
Local search study of honeycomb clustering problem for cellular planning
International Journal of Mobile Network Design and Innovation
International Journal of Autonomous and Adaptive Communications Systems
Embedding even-length cycles in a hexagonal honeycomb mesh
International Journal of Computer Mathematics
Vertex-bipancyclicity of the generalized honeycomb tori
Computers & Mathematics with Applications
Honeycomb toroidal graphs are Cayley graphs
Information Processing Letters
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori
Computers and Electrical Engineering
Applying 4-regular grid structures in large-scale access networks
Computer Communications
Diameter of parallelogramic honeycomb torus
Computers & Mathematics with Applications
The incidence coloring numbers of meshes
Computers & Mathematics with Applications
Upgradeability and predictability analysis for mesh topologies in optical distribution networks
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
Parallel Computing
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
XY-turn model for deadlock free routing in honeycomb networks-on-chip
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Energy conservation for wireless mobile ad hoc networks using hexagonal GAF protocol
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Resistance distances and the Kirchhoff index in Cayley graphs
Discrete Applied Mathematics
Further properties of cayley digraphs and their applications to interconnection networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Matrix-Star graphs: a new interconnection network based on matrix operations
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
On excessive index of certain networks
Theoretical Computer Science
Hi-index | 0.00 |
The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb mesh network with n nodes has degree 3 and ${\rm diameter}\approx 1.63\sqrt {\rm n}-1,$ which is 25 percent smaller degree and 18.5 percent smaller diameter than the mesh-connected computer with approximately the same number of nodes. Vertex and edge symmetric honeycomb torus network is obtained by adding wraparound edges to the honeycomb mesh. The network cost, defined as the product of degree and diameter, is better for honeycomb networks than for the two other families based on square (mesh-connected computers and tori) and triangular (hexagonal meshes and tori) tessellations. A convenient addressing scheme for nodes is introduced which provides simple computation of shortest paths and the diameter. Simple and optimal (in the number of required communication steps) routing, broadcasting, and semigroup computation algorithms are developed. The average distance in honeycomb torus with n nodes is proved to be approximately $0.54\sqrt {\rm n}.$ In addition to honeycomb meshes bounded by a regular hexagon, we consider also honeycomb networks with rhombus and rectangle as the bounding polygons.