Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
System design of the J-Machine
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
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
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Honeycomb tori are Hamiltonian
Information Processing Letters
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Performance of the CRAY T3E multiprocessor
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
High-Performance Computing on a Honeycomb Architecture
Proceedings of the Second International ACPC Conference on Parallel Computation
A Cell ID Assignment Scheme and Its Applications
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
Distance formula and shortest paths for the (n,k)-star graphs
Information Sciences: an International Journal
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
The number of shortest paths in the (n, k)-star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
The number of shortest paths in the arrangement graph
Information Sciences: an International Journal
| Hi-index | 0.00 |
We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k + 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, which leads to a straightforward formula for computing the distance between nodes and a very simple and elegant routing algorithm. The number of shortest paths between any two nodes and their description are also provided in this paper. We then derive closed formulas for the surface area (volume) of these networks, which are defined as the number of nodes located at a given distance (up to a given distance, respectively) from the origin node. The number of nodes and the network diameter under a more symmetrical border conditions are also derived. We show that a k-D hexagonal network of size t has the same degree, the same or lower diameter, and fewer nodes than a (k + 1)-D mesh of size t. Simple embeddings between two networks are also described. That is, we show how to reduce the dimension of a mesh by removing some nodes, and converting it into a hexagonal network, while preserving the simplicity of basic data communication schemes such as routing and broadcasting.