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
Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer
IEEE Transactions on Computers
A fault-tolerant hexagonal systolic array
Information Processing Letters
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
An Efficient Dictionary Machine Using Hexagonal Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Wireless and personal communications systems
Wireless and personal communications systems
Mobile and wireless networks
Parallel computation: models and methods
Parallel computation: models and methods
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
High-Performance Computing on a Honeycomb Architecture
Proceedings of the Second International ACPC Conference on Parallel Computation
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
| Hi-index | 0.00 |
The 2D hexagonal mesh, based on triangle plane tessellation, is considered as a multiprocessor interconnection network. The 3D hexagonal mesh is presented as a natural extension of the hexagonal mesh. Although the topological properties of the 2D hexagonal mesh are well known, existing addressing schemes are not suitable to be extended to 3D hexagonal mesh. Then, we present, in this paper, a new addressing scheme and an optimal routing algorithm for 2D hexagonal network based on the distance formula and using shortest paths. We propose also a 3D hexagonal network that can be built with 2D hexagonal meshes as a natural generalization. We also present some topological properties, an efficient addressing scheme, and an optimal routing algorithm based on our 2D routing algorithm.