Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Deadlock avoidance for systolic communication
Journal of Complexity
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Path selection for message passing in a circuit-switched multicomputer
Journal of Parallel and Distributed Computing
Replicated Process Allocation for Load Distribution in Fault-Tolerant Multicomputers
IEEE Transactions on Computers
A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive virtual cut-through as a viable routing method
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Throttle and Preempt: A New Flow Control for Real-Time Communications in Wormhole Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
A Real-Time Communication Method for Wormhole Switching Networks
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Priority Based Real-Time Communication for Large Scale Wormhole Networks
Proceedings of the 8th International Symposium on Parallel Processing
MMR: A High-Performance Multimedia Router - Architecture and Design Trade-Offs
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
A new approach to model virtual channels in interconnection networks
Journal of Computer and System Sciences
A new general method to compute virtual channels occupancy probabilities in wormhole networks
Journal of Computer and System Sciences
A method for calculating hard QoS guarantees for Networks-on-Chip
Proceedings of the 2009 International Conference on Computer-Aided Design
On the probability distribution of busy virtual channels
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An analytical approach for network-on-chip performance analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Real-time communication analysis for networks with two-stage arbitration
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Modeling real-time wormhole networks by queuing theory
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Designing best effort networks-on-chip to meet hard latency constraints
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Wireless Health Systems, On-Chip and Off-Chip Network Architectures
NoC contention analysis using a branch-and-prune algorithm
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Design Challenges for Many-Core Processors, Special Section on ESTIMedia'13 and Regular Papers
| Hi-index | 0.00 |
For real-time communication, we must be able to guarantee timely delivery of messages. In recent years, improvements in technology have made possible switch-based local area networks (LANs) and system area networks (SANs) that use wormhole switching, a pipelined switching technique which permits significantly shorter network latencies and higher throughputs than traditional store-and-forward packet switching. This paper proposes a model for real-time communication in such wormhole networks based on the use of real-time wormhole channels, which are simplex virtual circuits in wormhole networks with certain real-time guarantees. A distinguishing feature of our model is that it can be used in existing wormhole networks without any special hardware support. Preliminary delay analysis and properties are shown for the proposed real-time wormhole channel model. A practical quadratic time complexity algorithm is shown for determining the feasibility of a set of wormhole channels. Finally, as an example of the utility of our model, actual parameter values obtained from experiments on a Myrinet switch-based network are used to determine if real-time guarantees are possible for an example set of real-time traffic streams intermixed with nonreal-time traffic.