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
SpaceWire: a spacecraft onboard network for real-time communications
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Introduction to unmanned spacecraft on-board communications: evolution of timeliness needs
Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
Are virtual channels the bottleneck of priority-aware wormhole-switched NoC-based many-cores?
Proceedings of the 21st International conference on Real-Time Networks and Systems
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 |
The SpaceWire network standard is promoted by the ESA and is scheduled to be used as the sole on-board network for future satellites. This network uses a wormhole routing mechanism that can lead to packet blocking in routers and consequently to variable end-to-end delays. As the network will be shared by real-time and non real-time traffic, network designers require a tool to check that temporal constraints are verified for all the critical messages. Network Calculus can be used for evaluating worst-case end-to-end delays. However, we first have to model SpaceWire components through the definition of service curves. In this paper, we propose a new Network Calculus element that we call the Wormhole Section. This element allows us to better model a wormhole network than the usual multiplexer and demultiplexer elements used in the context of usual Store-and-Forward networks.