Abstract
For preemptive scheduling with shared cache, different tasks may cause interference in the shared cache, leading to Cache-Related Preemption Overhead (CRPD). Cache partitioning can be used to reduce or eliminate CRPD. We propose integration of cache partitioning and Preemption Threshold Scheduling to optimize schedulability for both Fixed-Priority and Earliest Deadline First scheduling algorithms on a uniprocessor. We let each subset of tasks assigned the same cache partition be a nonpreemptive group by assigning the same preemption threshold to them, which eliminates CRPD both within each cache partition and between different cache partitions.
- Sebastian Altmeyer, Robert Davis, Claire Maiza, and others. 2011. Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. In IEEE 32nd Real-Time Systems Symposium (RTSS’11). IEEE, 261--271. Google Scholar
Digital Library
- Sebastian Altmeyer, Robert I. Davis, and Claire Maiza. 2012. Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Systems 48, 5, 499--526. Google Scholar
Digital Library
- Sebastian Altmeyer, Roeland Douma, Will Lunniss, and Robert I. Davis. 2014. Outstanding paper: Evaluation of cache partitioning for hard real-time systems. In 26th Euromicro Conference onReal-Time Systems (ECRTS’14). IEEE, 15--26. Google Scholar
Digital Library
- Sebastian Altmeyer, Roeland Douma, Will Lunniss, and Robert I Davis. 2016. On the effectiveness of cache partitioning in hard real-time systems. Real-Time Systems 1--46. Google Scholar
Digital Library
- Theodore P. Baker. 1991. Stack-based scheduling of realtime processes. Real-Time Systems 3, 1, 67--99. Google Scholar
Digital Library
- Sanjoy K. Baruah. 2006. Resource sharing in EDF-scheduled systems: A closer look. In 27th IEEE International Real-Time Systems Symposium (RTSS’06). IEEE, 379--387. Google Scholar
Digital Library
- Brice Berna and Isabelle Puaut. 2012. PDPA: Period driven task and cache partitioning algorithm for multi-core systems. In Proceedings of the 20th International Conference on Real-Time and Network Systems. ACM, 181--189. Google Scholar
Digital Library
- Enrico Bini and Giorgio C Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Systems 30, 1--2, 129--154. Google Scholar
Digital Library
- Reinder J. Bril, Sebastian Altmeyer, Martijn M. H. P. Van Heuvel, Robert Davis, Moris Behnam, and others. 2014. Integrating cache-related pre-emption delays into analysis of fixed priority scheduling with pre-emption thresholds. In IEEE Real-Time Systems Symposium (RTSS’14). IEEE, 161--172.Google Scholar
- Bach Duy Bui, Marco Caccamo, Lui Sha, and Joseph Martinez. 2008. Impact of cache partitioning on multi-tasking real time embedded systems. In IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’08). IEEE, 101--110. Google Scholar
Digital Library
- José V. Busquets-Mataix, Juan J. Serrano, Rafael Ors, Pedro Gil, and Andy Wellings. 1996. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium. IEEE, 204--212. Google Scholar
Digital Library
- Giorgio C. Buttazzo. 2005. Rate monotonic vs. EDF: Judgment day. Real-Time Systems 29, 1, 5--26. Google Scholar
Digital Library
- Robert I. Davis. 2014. A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems. ACM SIGBED Review 11, 1, 8--19. Google Scholar
Digital Library
- Marco Di Natale, Liangpeng Guo, Haibo Zeng, and Alberto Sangiovanni-Vincentelli. 2010. Synthesis of multitask implementations of Simulink models with minimum delays. IEEE Transactions on Industrial Informatics 6, 4, 637--651.Google Scholar
Cross Ref
- Christian Ferdinand and Reinhold Heckmann. 2004. Ait: Worst-case execution time prediction by static program analysis. In Building the Information Society. Springer, 377--383.Google Scholar
- Paolo Gai, Giuseppe Lipari, and Marco Di Natale. 2001. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In Proceedings of 22nd IEEE Real-Time Systems Symposium (RTSS’01). IEEE, 73--83. Google Scholar
Digital Library
- Giovani Gracioli, Ahmed Alhammad, Renato Mancuso, Antônio Augusto Fröhlich, and Rodolfo Pellizzoni. 2015. A survey on cache management mechanisms for real-time embedded systems. ACM Computing Surveys 48, 2, 32. Google Scholar
Digital Library
- Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. 2009. Cache-aware scheduling and analysis for multicores. In Proceedings of the 7th ACM International Conference on Embedded Software. ACM, 245--254. Google Scholar
Digital Library
- Jan Gustafsson, Adam Betts, Andreas Ermedahl, and Björn Lisper. 2010. The Mälardalen WCET benchmarks: past, present and future. WCET 15, 136--146.Google Scholar
- Lei Ju, Samarjit Chakraborty, and Abhik Roychoudhury. 2007. Accounting for cache-related preemption delay in dynamic priority schedulability analysis. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE’07). IEEE, 1--6. Google Scholar
Digital Library
- Chang-Gun Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, and Chong Sang Kim. 1998. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on Computers 47, 6, 700--713. Google Scholar
Digital Library
- Benjamin Lesage, Isabelle Puaut, and André Seznec. 2012. PRETI: Partitioned REal-TIme shared cache for mixed-criticality real-time systems. In Proceedings of the 20th International Conference on Real-Time and Network Systems. ACM, 171--180. Google Scholar
Digital Library
- Will Lunniss, Sebastian Altmeyer, and Robert I. Davis. 2012. Optimising task layout to increase schedulability via reduced cache related pre-emption delays. In Proceedings of the 20th International Conference on Real-Time and Network Systems. ACM, 161--170. Google Scholar
Digital Library
- Will Lunniss, Sebastian Altmeyer, and Robert I. Davis. 2014. A comparison between fixed priority and EDF scheduling accounting for cache related pre-emption delays. Leibniz Transactions on Embedded Systems 1, 1, 01--1.Google Scholar
- Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari, and Robert I. Davis. 2015. Cache related pre-emption delays in hierarchical scheduling. Real-Time Systems 1--38. Google Scholar
Digital Library
- Will Lunniss, Sebastian Altmeyer, Claire Maiza, Robert Davis, and others. 2013. Integrating cache related pre-emption delay analysis into EDF scheduling. In 19th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’13). IEEE, 75--84. Google Scholar
Digital Library
- Frank Mueller. 1995. Compiler support for software-based cache partitioning. In ACM SIGPLAN Notices, Vol. 30. ACM, 125--133. Google Scholar
Digital Library
- Fadia Nemer, Hugues Cassé, Pascal Sainrat, Jean Paul Bahsoun, and Marianne De Michiel. 2006. PapaBench: A free real-time benchmark. WCET 4.Google Scholar
- Marco Paolieri, Eduardo Quiñones, Francisco J. Cazorla, Robert I. Davis, and Mateo Valero. 2011. IA<sup>3</sup>: An interference aware allocation algorithm for multicore hard real-time systems. In Real-Time and Embedded Technology and Applications Symposium (RTAS’11). IEEE, 280--290. Google Scholar
Digital Library
- J. Regehr. 2002. Scheduling tasks with mixed preemption relations for robustness to timing faults. In 23rd IEEE Real-Time Systems Symposium (RTSS’02). 315--326. DOI:http://dx.doi.org/10.1109/REAL.2002.1181585 Google Scholar
Digital Library
- Jan Staschulat, Simon Schliecker, and Rolf Ernst. 2005. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS’05). IEEE, 41--48. Google Scholar
Digital Library
- Yudong Tan and Vincent Mooney. 2007. Timing analysis for preemptive multitasking real-time systems with caches. ACM Transactions on Embedded Computing Systems 6, 1, 7. Google Scholar
Digital Library
- Ken W. Tindell, Alan Burns, and Andy J. Wellings. 1992. Allocating hard real-time tasks: An NP-hard problem made easy. Real-Time Systems 4, 2, 145--165. Google Scholar
Digital Library
- Hiroyuki Tomiyama and Nikil D. Dutt. 2000. Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In Proceedings of the 8th International Workshop on Hardware/Software Codesign. ACM, 67--71. Google Scholar
Digital Library
- Chao Wang, Zonghua Gu, and Haibo Zeng. 2015. Integration of cache partitioning and preemption threshold scheduling to improve schedulability of hard real-time systems. In 27th Euromicro Conference on Real-Time Systems (ECRTS’15). IEEE, 69--79. Google Scholar
Digital Library
- Yun Wang and Manas Saksena. 1999. Scheduling fixed-priority tasks with preemption threshold. In 6th International Conference on Real-Time Computing Systems and Applications (RTCSA’99). IEEE, 328--335. Google Scholar
Digital Library
- Haibo Zeng and Marco Di Natale. 2013. An efficient formulation of the real-time feasibility region for design optimization. IEEE Transactions on Computers 62, 4, 644--661. Google Scholar
Digital Library
- Fengxiang Zhang and Alan Burns. 2013. Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing. ACM Transactions on Embedded Computing Systems 12, 3, 67. Google Scholar
Digital Library
- Qingling Zhao, Zonghua Gu, and Haibo Zeng. 2013. PT-AMC: Integrating preemption thresholds into mixed-criticality scheduling. In Proceedings of the Conference on Design, Automation and Test in Europe. 141--146. Google Scholar
Digital Library
Index Terms
Cache-Partitioned Preemption Threshold Scheduling
Recommendations
Integration of Cache Partitioning and Preemption Threshold Scheduling to Improve Schedulability of Hard Real-Time Systems
ECRTS '15: Proceedings of the 2015 27th Euromicro Conference on Real-Time SystemsFor preemptive scheduling with shared cache, different tasks may cause interference in the shared cache, leading to Cache-Related Preemption Overhead (CRPD). Cache partitioning is a well-known technique for mitigating unpredictable cache interference in ...
Integration of Preemption Threshold and Quantum-Based Scheduling for Schedulability Enhancement of Fixed Priority Tasks
RTCSA '09: Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsFixed priority scheduling is an important real-time scheduling scheme widely used in practice. To improve the schedulability of fixed priority scheduling considerable effort has been made such as introduction of preemption threshold or deferred ...
On the effectiveness of cache partitioning in hard real-time systems
In hard real-time systems, cache partitioning is often suggested as a means of increasing the predictability of caches in pre-emptively scheduled systems: when a task is assigned its own cache partition, inter-task cache eviction is avoided, and timing ...






Comments