Advertisement

Resolving Contention for Networks-on-Chips: Combining Time-Triggered Application Scheduling with Dynamic Budgeting of Memory Bus Use

  • Kai LampkaEmail author
  • Adam Lackorzynski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9629)

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

Memory Access Active Budget Performance Counter Last Level Cache Decisive Budget 
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.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Real-Time Systems Series. Springer, Santa Clara (2011)CrossRefzbMATHGoogle Scholar
  3. 3.
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefzbMATHGoogle Scholar
  7. 7.
    Wang, A., Schild, H., Lackorzynski, A.: Faithful virtualization on a real-time operating system. In: 11th Real-Time Linux Workshopp (2009)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefzbMATHGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden
  2. 2.Department of Computer ScienceTechnische Universität DresdenDresdenGermany

Personalised recommendations