Wormhole networks properties and their use for optimizing worst case delay analysis of many-cores
Authors:
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503109,p. 1-10
Abstract
Many-core architectures are promising hardware to design hard real-time systems as they are based on simpler and thus more predictable processors than multi-core systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both inter-core and core to external memories or peripherals communications must be established. Several NoCs targeting hard real-time systems, made of specific hardware extensions, have been designed. However, none of these extensions are currently available in commercially existing NoC-based many-core architectures, that instead rely on wormhole switching with round-robin arbitration. In this paper, we thus demonstrate three properties of such NoC-based wormhole networks to identify worst-case scenarios and reduce the pessimism when modeling flows in contentions. We then describe and evaluate an algorithm to compute Worst-Case Traversal Time (WCTT) of flows that uses these properties. In particular, our results show that the pessimism can be reduced up to 50% compared to current state-of-the-art real-time packet schedulability analysis.Keywords
This publication has 23 references indexed in Scilit:
- A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks2012
- Using Network Calculus to compute end-to-end delays in SpaceWire networksACM SIGBED Review, 2011
- Aelite: A flit-synchronous Network on Chip with composable and predictable services2009
- Æthereal Network on Chip:Concepts, Architectures, and ImplementationsIEEE Design & Test of Computers, 2005
- Feasibility analysis of messages for on-chip networks using wormhole routing2005
- SoCBUS: switched network on chip for hard real time embedded systems2004
- Real-time wormhole channelsJournal of Parallel and Distributed Computing, 2003
- Timing anomalies in dynamically scheduled microprocessors2003
- Using rate monotonic scheduling technology for real-time communications in a wormhole network2002
- Service disciplines for guaranteed performance service in packet-switching networksProceedings of the IEEE, 1995