A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Bounds on Maximum Delay in Networks with Deflection Routing
IEEE Transactions on Parallel and Distributed Systems
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Æthereal Network on Chip: Concepts, Architectures, and Implementations
IEEE Design & Test
Feasibility analysis of messages for on-chip networks using wormhole routing
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A survey of research and practices of Network-on-chip
ACM Computing Surveys (CSUR)
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Slot allocation using logical networks for TDM virtual-circuit configuration for network-on-chip
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
From 2D to 3D NoCs: a case study on worst-case communication performance
Proceedings of the 2009 International Conference on Computer-Aided Design
| Hi-index | 0.00 |
In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource contention scenarios. In this paper, we present an analysis technique to derive the communication delay bound for individual flows. Based on a network contention model, this technique, which is topology independent, employs the network calculus theory to first compute the equivalent service curve for individual flows and then calculate their packet delay bound. To exemplify our method, we also present the derivation of a closed-form formula to calculate the delay bound for all-to-one gather communication. Our experimental results demonstrate the theoretical bounds are correct and tight.