Affiliation:
1. CISTER/INESC-TEC Research Center, Polytechnic Institute of Porto, Portugal
Abstract
“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the
traversal time
of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.
Funder
European Social Fund
FCT and COMPETE
Fundação para a Ciência e a Tecnologia
National Funds through FCT and ERDF (European Regional Development Fund) through COMPETE
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference25 articles.
1. Networks on chips: a new SoC paradigm
2. J.-Y. L. Boudec. and P. Thiran. 2004. Network Calculus—A Theory of Deterministic Queuing Systems for the Internet. Springer. J.-Y. L. Boudec. and P. Thiran. 2004. Network Calculus—A Theory of Deterministic Queuing Systems for the Internet. Springer.
3. Virtual-channel flow control
4. The torus routing chip
5. Response Time Analysis of COTS-Based Multicores Considering the Contention on the Shared Memory Bus
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献