Communications of the ACM - Special section on computer architecture
The connection machine
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
ACM Computing Surveys (CSUR)
HYDRA: the kernel of a multiprocessor operating system
Communications of the ACM
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
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
Reliable broadcast algorithms for HARTS
ACM Transactions on Computer Systems (TOCS)
Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability
IEEE Transactions on Computers
Evaluation of load sharing in HARTS while considering message routing and broadcasting
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Eliminating the boundary effect of a large-scale personal communication service network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fault-Tolerant Routing in Mesh Architectures
IEEE Transactions on Parallel and Distributed Systems
Establishment of Isolated Failure Immune Real-Time Channels in HARTS
IEEE Transactions on Parallel and Distributed Systems
Flexible oblivious router architecture
IBM Journal of Research and Development
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
A distributed I/O architecture for HARTS
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Ring embedding in faulty honeycomb rectangular torus
Information Processing Letters
A Distributed Real-Time Operating System
IEEE Software
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
Research on next-generation scalable routers implemented with H-Torus topology
Journal of Computer Science and Technology
The incidence coloring numbers of meshes
Computers & Mathematics with Applications
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A distributed algorithm for hexagonal topology formation in wireless sensor networks
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Parallel Computing
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Efficient minimal routing in the triangular grid with six channels
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
X-torus: a variation of torus topology with lower diameter and larger bisection width
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
Discrete Applied Mathematics
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
European Journal of Combinatorics
| Hi-index | 14.99 |
A family of six-regular graphs, called hexagonal meshes or H-meshes, is considered as a multiprocessor interconnection network. Processing nodes on the periphery of an H-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p/sup 1/2/), where p is the number of nodes in the H-mesh. An elegant, distributed routing scheme is developed for wrapped H-meshes so that each node in an H-mesh can compute shortest paths from itself to any other node with a straightforward algorithm of O(1) using the addresses of the source-destination pair only, i.e. independent of the network's size. This is in sharp contrast with those previously known algorithms that rely on using routing tables. Furthermore, the authors also develop an efficient point-to-point broadcasting algorithm for the H-meshes which is proved to be optimal in the number of required communication steps. The wrapped H-meshes are compared against some other existing multiprocessor interconnection networks, such as hypercubes, trees, and square meshes. The comparison reinforces the attractiveness of the H-mesh architecture.