2007
DOI: 10.1145/1210268.1210275
|View full text |Cite
|
Sign up to set email alerts
|

Timing analysis for preemptive multitasking real-time systems with caches

Abstract: In this paper, we propose an approach to estimate the worst-case response time (WCRT) of each task in a preemptive multitasking single-processor real-time system utilizing an L1 cache. The approach combines intertask cache-eviction analysis and intratask cache-access analysis to estimate the number of cache lines that can possibly be evicted by the preempting task and also be accessed again by the preempted task after preemptions (thus requiring the preempted task to reload the cache line(s)). This cache-reloa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 61 publications
(35 citation statements)
references
References 27 publications
0
35
0
Order By: Relevance
“…The integration of CRPD in the schedulability analysis of tasks has been addressed for FPPS with a focus on the pre-empting tasks (Busquets-Mataix et al 1996;Tomiyama and Dutt 2000), the pre-empted tasks (Lee et al 1998), and by considering both the pre-empting and pre-empted tasks (Staschulat et al 2005;Tan and Mooney 2007;Altmeyer et al 2012). Figure 1 gives an overview of the various approaches and their relation.…”
Section: Cache-related Pre-emption Delays (Crpds)mentioning
confidence: 99%
“…The integration of CRPD in the schedulability analysis of tasks has been addressed for FPPS with a focus on the pre-empting tasks (Busquets-Mataix et al 1996;Tomiyama and Dutt 2000), the pre-empted tasks (Lee et al 1998), and by considering both the pre-empting and pre-empted tasks (Staschulat et al 2005;Tan and Mooney 2007;Altmeyer et al 2012). Figure 1 gives an overview of the various approaches and their relation.…”
Section: Cache-related Pre-emption Delays (Crpds)mentioning
confidence: 99%
“…The crudest approach to CRPD analysis is to assume that every preemption causes a complete flush of the entire cache; a safe but often imprecise assumption. Successively more precise estimates have been achieved by researchers [Busquets-Mataix et al 1996;Lee et al 1998;Staschulat et al 2005;Tan and Mooney 2007;Altmeyer and Maiza 2010;Altmeyer et al 2011;2012]. Estimates are generated by examining which cache blocks are definitely reused by lower-priority tasks (useful cache blocks) and which cache blocks are accessed by higher-priority tasks (evicted cache blocks).…”
Section: Real-time Systems Sharing the Cachementioning
confidence: 99%
“…Subsequent analyses introduced UCB sets to the analysis [Tan and Mooney 2007;Altmeyer and Maiza 2010], which can be used in different ways (e.g. ECB-Union, UCB-Union) to produce a more accurate CRPD estimate [Altmeyer et al 2011].…”
Section: Reducing Crpd By Better Analysismentioning
confidence: 99%
“…UCB-Union UCB-Union is one definition for γ i,j . Introduced by Tan and Mooney [13], UCB-Union dominates an earlier ECB-only approach described by Busquets et al [12].…”
Section: B Crpd-rtamentioning
confidence: 99%
“…CRPD may be determined by considering which cache blocks are reused by preempted tasks and evicted by preempting tasks. Recent work has established a number of approaches for this [11], [12], [13], [14], [15], [16], [17]. Figure 1 shows how SRPD and CRPD are compared in this paper.…”
Section: Introduction Scratchpad Memory (Spm) Is a Form Of Local Mmentioning
confidence: 99%