Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Reliable broadcast algorithms for HARTS
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
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
Design and evaluation of a DRAM-based shared memory ATM switch
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A distributed I/O architecture for HARTS
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A Distributed Real-Time Operating System
IEEE Software
IEEE Transactions on Parallel and Distributed Systems
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Mathematical and Computer Modelling: An International Journal
Discrete Applied Mathematics
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
European Journal of Combinatorics
| Hi-index | 15.00 |
The authors present a formal analysis of virtual cut-through in a C-wrapped hexagonal mesh multicomputer, called the HARTS (hexagonal architecture for real-time systems). In virtual cut-through, packets arriving at an intermediate node are forwarded to the next node in the route without buffering if a circuit can be established to the next node. The hexagonal mesh is first characterized using a combinatorial analysis to determine the probability that a packet will establish a cut-through at an intermediate node. Given this parameter the probability distribution function for packet delivery times in HARTS is derived. The delivery times obtained from the analytic model are then compared against results collected from a simulator of the routing hardware designed for use in HARTS. The results from both the analytic model and the simulator further reinforce the choice of the virtual cut-through routing scheme for use in HARTS.