Improved Cache-Related Preemption Delay Estimation for Fixed Preemption Point Scheduling
Pages 87 - 101
Abstract
Cache-Related Preemption Delays (CRPD) can significantly increase tasks’ execution time in preemptive real-time scheduling, potentially jeopardising the system schedulability. In order to reduce the cumulative CRPD, Limited Preemptive Scheduling (LPS) has emerged as a scheduling approach which limits the maximum number of preemptions encountered by real-time tasks, thus decreasing CRPD compared to fully preemptive scheduling. Furthermore, an instance of LPS, called Fixed Preemption Point Scheduling (LP-FPP), defines the exact points where the preemptions are permitted within a task, which enables a more precise CRPD estimation. The majority of the research, in the domain of LP-FPP, estimates CRPD with pessimistic upper bounds, without considering the possible sources of over-approximation: (1) accounting for the infeasible preemption combinations, and (2) accounting for the infeasible cache block reloads. In this paper, we improve the analysis by accounting for those two cases towards a more precise estimation of the CRPD upper bounds. The evaluation of the approach on synthetic tasksets reveals a significant reduction of the pessimism in the calculation of the CRPD upper bounds, compared to the existing approaches.
References
[1]
Pellizzoni, R., Bui, B.D., Caccamo, M., Sha, L.: Coscheduling of CPU and I/O transactions in COTS-based embedded systems. In: Real-Time Systems Symposium, pp. 221–231. IEEE (2008)
[2]
Wang, Y., Saksena, M.: Scheduling fixed-priority tasks with preemption threshold. In: Sixth International Conference on Real-Time Computing Systems and Applications, RTCSA 1999, pp. 328–335. IEEE (1999)
[3]
Baruah, S.: The limited-preemption uniprocessor scheduling of sporadic task systems. In: 17th Euromicro Conference on Real-Time Systems (ECRTS 2005), pp. 137–144. IEEE (2005)
[4]
Burns, A., Son, E.S.: Preemptive priority based scheduling: an appropriate engineering approach. In: Advances in Real-Time Systems, pp. 225–248 (1994)
[5]
Bertogna, M., Xhani, O., Marinoni, M., Esposito, F., Buttazzo, G.: Optimal selection of preemption points to minimize preemption overhead. In: 2011 23rd Euromicro Conference on Real-Time Systems (ECRTS), pp. 217–227. IEEE (2011)
[6]
Buttazzo GC, Bertogna M, and Yao G Limited preemptive scheduling for real-time systems. A survey IEEE Trans. Ind. Inform. 2013 9 1 3-15
[7]
Peng, B., Fisher, N., Bertogna, M.: Explicit preemption placement for real-time conditional code. In: 2014 26th Euromicro Conference on Real-Time Systems (ECRTS), pp. 177–188. IEEE (2014)
[8]
Markovic, F., Carlson, J., Dobrin, R.: Tightening the bounds on cache-related preemption delay in fixed preemption point scheduling. Presented at the 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017). OASIcs-OpenAccess Series in Informatics, vol. 57. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)
[9]
Lee C-G, Han J, Seo Y-M, Min SL, Ha R, Hong S, Park CY, Lee M, and Kim CS Analysis of cache-related preemption delay in fixed-priority preemptive scheduling IEEE Trans. Comput. 1998 47 6 700-713
[10]
Altmeyer, S., Burguiere, C.: A new notion of useful cache block to improve the bounds of cache-related preemption delay. In: 21st Euromicro Conference on Real-Time Systems, ECRTS 2009, pp. 109–118. IEEE (2009)
[11]
CHOCO: Open Source Java Library for Constraint Programming. http://www.choco-solver.org/. Accessed 13 Apr 2017
[12]
Bini E and Buttazzo GC Measuring the performance of schedulability tests Real Time Syst. 2005 30 1–2 129-154
[13]
Sebastian, A., Roeland, D., Will, L., Robert, I.D.: Evaluation of cache partitioning for hard real-time systems. In: Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), pp. 15–26 (2014)
[14]
IBM ILOG CPLEX. https://www.ibm.com/analytics/data-science/prescriptive-analytics/cplex-optimizer. Accessed 25 Feb 2018
[15]
Tan Y and Mooney V Timing analysis for preemptive multitasking real-time systems with caches ACM Trans. Embed. Comput. Syst. (TECS) 2007 6 1 7
[16]
Busquets-Mataix, J.V., Serrano, J.J., Ors, R., Gil, P., Wellings, A.: Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In: Proceedings of 1996 IEEE Real-Time Technology and Applications Symposium, pp. 204–212. IEEE (1996)
[17]
Tomiyama, H., Dutt, N.D.: Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In: Proceedings of the Eighth International Workshop on Hardware/Software Codesign, pp. 67–71. ACM (2000)
[18]
Staschulat, J. Schliecker, S., Ernst, R.: 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 2005), pp. 41–48. IEEE (2005)
[19]
Altmeyer S, Davis RI, and Maiza C Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems Real Time Syst. 2012 48 5 499-526
[20]
Ramaprasad H and Mueller F Tightening the bounds on feasible preemptions ACM Trans. Embed. Comput. Syst. (TECS) 2010 10 2 27
[21]
Cavicchio, J., Tessler, C., Fisher, N.: Minimizing cache overhead via loaded cache blocks and preemption placement. In: 2015 27th Euromicro Conference on Real-Time Systems (ECRTS), pp. 163–173. IEEE (2015)
Recommendations
Towards Analysing Cache-Related Preemption Delay in Non-Inclusive Cache Hierarchies
The impact of preemptions has to be considered when determining the schedulability of a task set in a preemptively scheduled system. In particular, the contents of caches can be disturbed by a preemption, thus creating context-switching costs. These ...
Cache-related preemption delay via useful cache blocks: Survey and redefinition
Tasks in an embedded system are scheduled either preemptively or non-preemptively. In case of preemptive scheduling, interferences on the cache of the preempted and preempting task may extend the execution times. The corresponding delay is referred to ...
Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points
RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and SystemsThis paper aims at advancing the relative strength of limited-preemptive schedulers by improving the feasibility of a task set and simultaneously limiting, or even precluding, arbitrary preemptions. In particular, we present a refinement of existing ...
Comments
Information & Contributors
Information
Published In
Jun 2018
178 pages
© Springer International Publishing AG, part of Springer Nature 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 18 June 2018
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025