Abstract
One of the challenges for the design of integrated real-time systems deployed on modern multicore architectures is the finding of system configurations where all applications are guaranteed to complete their computations prior to their individual deadlines. Traditionally, timing feasability analysis, i.e., sche-dulability tests, take activation patterns and worst-case execution times (WCET) of applications as input. In the setting of mutlicore architectures with shared infrastructure, WCET are drastically overestimated as the number of accesses to a shared resource and their service times not only depend on the application itself, the service times experienced at the shared resource are significantly influenced by its use by applications executing on other cores. There are several ways to deal with the above phenomenon and give guarantees for the timing behaviour of a real-time system deployed on concurrent hardware. One either devise analysis techniques and accept the potential under-utilization of the hardware or one may employ specific protocols for coordinating the resource sharing. In this paper, we do both: (a) we combine time triggered, core-local scheduling of real-time applications with a dynamic budgeting scheme for controlling the access to the main memory bus. (b) We show how the obtained access budgets can be used at design time to ensure timing correctness at design-time. The scheme is implemented in a microkernel based operating system and we present experiments to investigate its performance.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
With co-runners we refer to the applications which are located at other cores and executing in parallel to the application under consideration.
- 2.
The partitioning into hard and soft real-time cores simplifies the signalling overhead and simplifies the description of the scheme. If necessary, it could be dropped, but this would require maintenance of a budget also on the side of hard real-time cores.
References
Alhammad, A., Pellizzoni, R.: Schedulability analysis of global memory predictable scheduling. In: 2014 International Conference on Embedded Software, EMSOFT 2014, NewDelhi, India, 12-17 October 2014, pp. 20:1–20:10 (2014)
Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Real-Time Systems Series. Springer, Santa Clara (2011)
EEMBC. http://www.eembc.org/
Flodin, J., Lampka, K., Yi, W.: Dynamic budgeting for settling DRAM contention of co-running hard and soft real-time tasks. In: Proceedings of the 9th IEEE International Symposium on Industrial Embedded Systems, SIES 2014, pp. 151–159 (2014)
Fohler, G.: Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, pp. 152–161 (1995)
Giannopoulou, G., Stoimenov, N., Huang, P., Thiele, L., de Dinechin, B.D.: Mixed-criticality scheduling on cluster-based manycores with shared communication and storage resources. Real Time Syst. 51, 1–51 (2015)
Wang, A., Schild, H., Lackorzynski, A.: Faithful virtualization on a real-time operating system. In: 11th Real-Time Linux Workshopp (2009)
Lackorzynski, A., Warg, A.: Taming subsystems: capabilities as universal resource access control in l4. In: Proceedings of the 2nd Workshop on Isolation and Integration in Embedded Systems, IIES 2009, pp. 25–30, ACM, New York (2009)
Lackorzyński, A., Warg, A., Völp, M., Härtig, H.: Flattening hierarchical scheduling. In: Proceedings EMSOFT 2012, pp. 93–102. ACM, New York (2012)
Lampka, K., et al.: A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets. Real Time Syst. 50(5–6), 736–773 (2014)
Peter, M., Schild, H., Lackorzynski, A., Warg, A., Virtual machines jailed: virtualization in systems with small trusted computing bases. In: Proceedings of VDTS, pp. 18–23. ACM, New York (2009)
Yun, H., Yao, G., Pellizzoni, R., Caccamo, M., Sha, L.: Memory access control in multiprocessor for real-time systems with mixed criticality. In: 2012 24th Euromicro Conference on Real-Time Systems (ECRTS), pp. 299–308 (2012)
Yun, H., Yao, G., Pellizzoni, R., Caccamo, M., Sha, L.: Memguard: memory bandwidth reservation system for efficient performance isolation in multi-core platforms. In: Real-Time and Embedded Technology and Applications Symposium (RTAS) 2013, pp. 55–64 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Lampka, K., Lackorzynski, A. (2016). Resolving Contention for Networks-on-Chips: Combining Time-Triggered Application Scheduling with Dynamic Budgeting of Memory Bus Use. In: Remke, A., Haverkort, B.R. (eds) Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems. MMB&DFT 2016. Lecture Notes in Computer Science(), vol 9629. Springer, Cham. https://doi.org/10.1007/978-3-319-31559-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-31559-1_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31558-4
Online ISBN: 978-3-319-31559-1
eBook Packages: Computer ScienceComputer Science (R0)