Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling

ABSTRACT

This paper introduces analyses of write-back caches integrated into response-time analysis for fixed-priority preemptive and non-preemptive scheduling. For each scheduling paradigm, we derive four different approaches to computing the additional costs incurred due to write backs. We show the dominance relationships between these different approaches and note how they can be combined to form a single state-of-the-art approach in each case. The evaluation explores the relative performance of the different methods using a set of benchmarks, as well as making comparisons with no cache and a write-through cache.

References

1. EEMBC Autobench. http://www.eembc.org/benchmark/automotive_sl.php. Accessed: 2016-04-29.
2. S. Altmeyer, R.I. Davis, and C. Maiza. Cache related pre-emption aware response time analysis for fixed priority pre-emptive systems. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS), pages 261--271, December 2011.
3. S. Altmeyer, R.I. Davis, and C. Maiza. Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Systems, 48(5):499--526, 2012.
4. S. Altmeyer, R. Douma, W. Lunniss, and R.I. Davis. Evaluation of cache partitioning for hard real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), pages 15--26, July 2014.
5. S. Altmeyer, R. Douma, W. Lunniss, and R.I. Davis. On the effectiveness of cache partitioning in hard real-time systems. Real-Time Systems, pages 1--46, Jan 2016.
6. S. Altmeyer and C. Maiza. Cache-related preemption delay via useful cache blocks: Survey and redefinition. Journal of Systems Architecture, 57:707--719, August 2011.
7. S. Altmeyer, C. Maiza, and J. Reineke. Resilience analysis: Tightening the crpd bound for set-associative caches. In Proceedings of the Conference on Languages, Compilers, Tools and Theory for Embedded Systems (LCTES), pages 153--162, April 2010.
8. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A.J. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 1993.
9. A. Bastoni et al. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings of the workshop on Operating Systems Platforms for Embedded Real-Time applications (OSPERT), pages 33--44, July 2010.
10. E. Bini and G.C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1):129--154, 2005.
11. N. Binkert et al. The gem5 simulator. SIGARCH Comput. Archit. News, 39(2):1--7, August 2011.
12. R.J. Bril, S. Altmeyer, M. van den Heuvel, R.I. Davis, and M. Behnam. Integrating cache-related pre-emption delays into analysis of fixed priority scheduling with pre-emption thresholds. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS), pages 161--172, December 2014.
13. R.J. Bril, J.J. Lukkien, and W.F.J. Verhaegh. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems, 42(1):63--119, 2009.
14. C. Burguière, J. Reineke, and S. Altmeyer. Cache-related preemption delay computation for set-associative caches -pitfalls and solutions. In Proceedings of the International Workshop on Worst-Case Execution Time Analysis (WCET), pages 1--11, 2009.
15. A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. In S.H. Son, editor, Advances in Real-Time Systems, pages 225--248. Prentice-Hall, 1994.
16. J. V. Busquets-Mataix, J. J. Serrano, R. Ors, P. Gil, and A. Wellings. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Proceedings of the IEEE Real-Time Embedded Technology and Applications (RTAS), pages 204--212, June 1996.
17. R.I. Davis, S. Altmeyer, and J. Reineke. Analysis of write-back caches under fixed-priority preemptive and non-preemptive scheduling. Technical report https://www.cs.york.ac.uk/ftpdir/reports/2016/YCS/502/YCS-2016-502.pdf, University of York, 2016.
18. R.I. Davis, A. Burns, R.J. Bril, and J.J. Lukkien. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239--272, 2007.
19. C. Ferdinand and R. Wilhelm. Efficient and precise cache behavior prediction for real-time systems. Real-Time Sys., 17(2-3):131--181, 1999.
20. J. Gustafsson et al. The Mälardalen WCET benchmarks --past, present and future. In Proceedings of the International workshop on Worst-Case Execution Time Analysis (WCET), pages 137--147, July 2010.
21. S. Hahn, J. Reineke, and R. Wilhelm. Towards compositionality in execution time analysis -- definition and challenges. In Proceedings of the International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS), December 2013.
22. M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 1986.
23. D.I. Katcher, H. Arakawa, and J.K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Trans. Softw. Eng., 19, 1993.
24. Chang-Gun Lee et al. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on Computers, 47(6):700--713, 1998.
25. Y-T. S. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond direct mapped instruction caches. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 254--263, Dec 1996.
26. W. Lunniss, S. Altmeyer, and R.I. Davis. 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 (RTNS), pages 161--170, 2012.
27. M. Saksena and Y. Wang. Scalable real-time system design using preemption thresholds. In Proceeding of the IEEE Real-Time Systems Symposium (RTSS), pages 25--34, December 2000.
28. T. Sondag and H. Rajan. A more precise abstract domain for multi-level caches for tighter WCET analysis. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS), pages 395--404, Nov 2010.
29. J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), pages 41--48, July 2005.
30. Y. Tan and V. J. Mooney. Timing analysis for preemptive multi-tasking real-time systems with caches. ACM Trans. on Embedded Comput. Syst., 6(1), 2007.
31. C. Wang, Z. Gu, and H. Zeng. Integration of cache partitioning and preemption threshold scheduling to improve schedulability of hard real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), pages 69--79, 2015.
32. Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the International Conference on Real-Time Computing Systems and Applications (RTCSA), pages 328--335, 1999.