article

Cache-related preemption delay via useful cache blocks: Survey and redefinition

Authors:

Sebastian Altmeyer,

Claire Maiza BurguièreAuthors Info & Claims

Journal of Systems Architecture: the EUROMICRO Journal, Volume 57, Issue 7

Pages 707 - 719

https://doi.org/10.1016/j.sysarc.2010.08.006

Published: 01 August 2011 Publication History

Abstract

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 as cache-related preemption delay (CRPD). Lee et al. [6] presented a CRPD analysis using the concept of useful cache block (UCB): a cache block is useful if it may be in the cache before a program point and may be reused after this point. If a preemption occurs at that point, the number of additional cache misses is bounded by the number of UCBs. An upper bound on the CRPD of the whole task is thus given by the program point with the largest set of UCBs. In this article, we provide a survey of the state of the art techniques to bound the CRPD, based on, but not limited to UCBs. Based on this survey we present an alternative definition of UCBs to improve the CRPD bounds substantially.

References

[1]

Altmeyer, S., Maiza, C., Reineke, J., 2010. Resilience analysis: tightening the crpd bound for set-associative caches. In: LCTES'10: Proceedings of the ACM SIGPLAN/SIGBED 2010 Conference on Languages, Compilers, and Tools for Embedded Systems. ACM, New York, NY, USA, pp. 153-162.

[2]

Burguière, C., Reineke, J., Altmeyer, S., 2009. Cache-related preemption delay computation for set-associative caches: pitfalls and solutions. In: Proceedings of the Workshop on WCET Analysis (WCET'09).

[3]

Cousot, P. and Cousot, R., Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the 4th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY. pp. 238-252.

[4]

Ferdinand, C., Martin, F., Wilhelm, R. and Alt, M., Cache behavior prediction by abstract interpretation. Science of Computer Programming. v35 i2/3. 163-189.

[5]

Kim, S., Min, S.L. and Ha, R., Efficient worst case timing analysis of data caching. In: IEEE Real-Time Technology and Applications Symposium (RTAS'96), IEEE. pp. 230-240.

[6]

Lee, C.-G., Hahn, J., Min, S.L., Ha, R., Hong, S., Park, C.Y., Lee, M. and Kim, C.S., Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS'96), IEEE Computer Society, Washington, DC, USA. pp. 264

[7]

Lee, C.-G., Hahn, J., Seo, Y.-M., Min, S.L., Ha, R., Hong, S., Park, C.Y., Lee, M. and Kim, C.S., Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Transactions on Computers. v47 i6. 700-713.

[8]

Lim, S.-S., Bae, Y.H., Jang, G.T., Rhee, B.-D., Min, S.L., Park, C.Y., Shin, H., Park, K., Moon, S.-M. and Kim, C.S., An accurate worst-case timing analysis for RISC processors. IEEE Transactions on Software Engineering. v21 i7. 593-604.

[9]

Lundqvist, T. and Stenström, P., Timing anomalies in dynamically scheduled microprocessors. In: Proceedings of the 20th IEEE Real-Time Systems Symposium (RTSS'99), IEEE Computer Society, Washington, DC, USA. pp. 12

[10]

Mueller, F., Timing analysis for instruction caches. Real-Time Systems. v18. 209-239.

[11]

Negi, H.S., Mitra, T. and Roychoudhury, A., Accurate estimation of cache-related preemption delay. In: Proceedings of the 1st ACM International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS'03), ACM, New York, NY, USA. pp. 201-206.

[12]

Nielson, F., Nielson, H.R. and Hankin, C., Principles of Program Analysis. 1999. Springer-Verlag New York, Inc., Secaucus, NJ, USA.

[13]

Ramaprasad, H. and Mueller, F., Bounding preemption delay within data cache reference patterns for real-time tasks. In: Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), IEEE Computer Society, Washington, DC. pp. 71-80.

[14]

Reineke, J., 2008. Caches in WCET Analysis. Ph.D. Thesis, Universität des Saarlandes, Saarbrücken.

[15]

Staschulat, J. and Ernst, R., Scalable precision cache analysis for preemptive scheduling. In: Proceedings of the 2005 ACM Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'05), ACM, New York, NY, USA. pp. 157-165.

[16]

Staschulat, J. and Ernst, R., Scalable precision cache analysis for real-time software. Transactions on Embedded Computing Systems. v6 i4. 25

[17]

Tan, Y., Mooney, V., 2004. Integrated intra- and inter-task cache analysis for preemptive multi-tasking real-time systems. In: Proceedings of the 8th International Workshop SCOPES 2004. Lecture Notes on Computer Science (LNCS), vol. 3199. Press, pp. 182-199.

[18]

Theiling, H., 2002. ILP-based interprocedural path analysis. In: Proceedings of the EMSOFT 2002, Second Workshop on Embedded Software.

[19]

Tomiyama, H. and Dutt, N.D., Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In: Proceedings of the 8th ACM International Workshop on Hardware/Software Codesign (CODES'00), ACM, New York, NY, USA. pp. 67-71.

[20]

White, R.T., Healy, C.A., Whalley, D.B., Mueller, F. and Harmon, M.G., Timing analysis for data caches and set-associative caches. In: Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS'97), IEEE Computer Society, Washington, DC, USA. pp. 192

Cited By

Fischer TFalk H(2024)Towards Analysing Cache-Related Preemption Delay in Non-Inclusive Cache HierarchiesACM Transactions on Embedded Computing Systems10.1145/369576824:1(1-37)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1145/3695768
Fischer TFalk H(2024)Timing-aware analysis of shared cache interference for non-preemptive schedulingReal-Time Systems10.1007/s11241-024-09430-860:4(570-624)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11241-024-09430-8
Lesage BDai XZhao SBate I(2023)Reducing Loss of Service for Mixed-Criticality Systems through Cache- and Stress-Aware SchedulingProceedings of the 31st International Conference on Real-Time Networks and Systems10.1145/3575757.3593654(188-199)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3575757.3593654
Show More Cited By

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 analysis for FIFO caches
LCTES '14

Hard real-time systems are typically composed of multiple tasks, subjected to timing constraints. To guarantee that these constraints will be respected, the Worst-Case Response Time (WCRT) of each task is needed. In the presence of systems supporting ...
Using dead blocks as a virtual victim cache
PACT '10: Proceedings of the 19th international conference on Parallel architectures and compilation techniques

Caches mitigate the long memory latency that limits the performance of modern processors. However, caches can be quite inefficient. On average, a cache block in a 2MB L2 cache is dead 59% of the time, i.e., it will not be referenced again before it is ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Systems Architecture: the EUROMICRO Journal

Journal of Systems Architecture: the EUROMICRO Journal Volume 57, Issue 7

August, 2011

60 pages

ISSN:1383-7621

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2010.

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 August 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fischer TFalk H(2024)Towards Analysing Cache-Related Preemption Delay in Non-Inclusive Cache HierarchiesACM Transactions on Embedded Computing Systems10.1145/369576824:1(1-37)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1145/3695768
Fischer TFalk H(2024)Timing-aware analysis of shared cache interference for non-preemptive schedulingReal-Time Systems10.1007/s11241-024-09430-860:4(570-624)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11241-024-09430-8
Lesage BDai XZhao SBate I(2023)Reducing Loss of Service for Mixed-Criticality Systems through Cache- and Stress-Aware SchedulingProceedings of the 31st International Conference on Real-Time Networks and Systems10.1145/3575757.3593654(188-199)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3575757.3593654
Xiao JShen YPimentel A(2022)Cache Interference-aware Task Partitioning for Non-preemptive Real-time Multi-core SystemsACM Transactions on Embedded Computing Systems10.1145/348758121:3(1-28)Online publication date: 28-May-2022
https://dl.acm.org/doi/10.1145/3487581
Bouquillon FLipari GNiar SHong JBures MPark JCerny T(2022)Improving CRPD analysis for EDF schedulingProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507027(481-490)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507027
Sohal PTabish RDrepper UMancuso R(2022)Profile-driven memory bandwidth management for accelerators and CPUs in QoS-enabled platformsReal-Time Systems10.1007/s11241-022-09382-x58:3(235-274)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11241-022-09382-x
Tran HHonorat ABhattacharyya STalpin JGautier TBesnard L(2021)A Framework for Fixed Priority Periodic Scheduling Synthesis from Synchronous Data-Flow GraphsEmbedded Computer Systems: Architectures, Modeling, and Simulation10.1007/978-3-031-04580-6_17(259-271)Online publication date: 4-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-031-04580-6_17
Senoussaoui IZahaf HBenhaoua MLipari GOlejnik RCucu-Grosjean LMedina RAltmeyer SScharbarg J(2020)Allocation of Real-Time Tasks onto Identical Core Platforms under Deferred fixed Preemption-Point ModelProceedings of the 28th International Conference on Real-Time Networks and Systems10.1145/3394810.3394821(34-43)Online publication date: 9-Jun-2020
https://dl.acm.org/doi/10.1145/3394810.3394821
Louise S(2019)A First Step Toward Using Quantum Computing for Low-level WCETs EstimationsACM Transactions on Architecture and Code Optimization10.1145/333554916:3(1-22)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3335549
Davis RAltmeyer SReineke J(2018)Response-time analysis for fixed-priority systems with a write-back cacheReal-Time Systems10.5555/3288651.328873554:4(912-963)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.5555/3288651.3288735
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents