OUTSTANDING PAPER: Evaluation of Cache Partitioning for Hard Real-Time Systems

Altmeyer, Sebastian; Douma, Roeland; Lunniss, Will; Davis, Robert I.

doi:10.1109/ecrts.2014.11

Cited by 36 publications

(44 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further work in this area by Wang et al (2015) showed that by using preemption thresholds, groups of tasks can share a partition while still avoiding CRPD. This results in a hybrid approach that can outperform the approach of Altmeyer et al (2014).…”

Section: Accounting For Overheads In Schedulability Analysismentioning

confidence: 99%

“…Altmeyer et al (2014Altmeyer et al ( , 2016 derived an optimal cache partitioning algorithm for the case where each task has its own partition. They compared cache partitioning and cache sharing accounting for CRPD, concluding that the trade off between longer worst-case execution times and CRPD often favours sharing the cache rather than partitioning it.…”

Section: Accounting For Overheads In Schedulability Analysismentioning

confidence: 99%

See 1 more Smart Citation

Response-time analysis for fixed-priority systems with a write-back cache

2018

Self Cite

View full text Add to dashboard Cite

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. We also explore the effect of write buffers used to hide the latency of write-through caches. We show that depending upon the depth of the buffer used and the policies employed, such buffers can result in domino effects. Our evaluation shows that even ignoring domino effects, a substantial write buffer is needed to match the guaranteed performance of write-back caches.

show abstract

Section: Accounting For Overheads In Schedulability Analysismentioning

confidence: 99%

Section: Accounting For Overheads In Schedulability Analysismentioning

confidence: 99%

Response-time analysis for fixed-priority systems with a write-back cache

2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…The elimination of CRPDs between tasks may then not compensate for the performance degradation in the computation times of tasks. In the current paper, we therefore follow the line of reasoning by Altmeyer et al (2014) and we complement our assignment of pre-emption thresholds with an algorithm for improving the memory layout of tasks.…”

Section: Cache-related Pre-emption Delays (Crpds)mentioning

confidence: 99%

“…As described in Altmeyer et al (2014) and Wang et al (2015), the worst-case computation time of a task depends on the size of the cache. Whereas the worst-case computation C i of task τ i is fixed when |MB i | ≤ N C , it may increase when |MB i | becomes larger than N C due to self-eviction, i.e.…”

Section: A Model For Cache-related Pre-emption Costsmentioning

confidence: 99%

“…Cache partitioning (or cache locking) may be implemented by means of hardware support (Kirk 1989) or by means of software support (Puaut and Decotigny 2002). Altmeyer et al (2014) showed that cache partitioning may slightly improve the performance of simple, short control tasks of which the pre-emption costs are relatively high compared to the computation times. However, they observed that the advantage of cache partitioning is often negligible when the memory layout of tasks is improved, so that memory blocks are loaded in the cache with less overlap.…”

Section: Cache-related Pre-emption Delays (Crpds)mentioning

confidence: 99%

See 1 more Smart Citation

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

Self Cite

View full text Add to dashboard Cite

Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry. Keywords Fixed-priority pre-emptive scheduling · Fixed-priority scheduling with pre-emption thresholds · Cache-related pre-emption delay · Response-time analysis B Reinder J. Bril

show abstract

Online and offline scheduling with cache-related preemption delays

et al. 2017

View full text Add to dashboard Cite

In this paper, we consider the problem of scheduling hard real-time tasks subjected to preemption delays on a uniprocessor system. While most of the existing work focus on either reducing these additional delays or improving the system predictability by bounding them, we focus in this work on the problem of taking scheduling decisions while considering preemption delays. We first study the behavior of existing online scheduling policies such as rm and edf when accounting for preemption delays. Then we prove that there exists no optimal online algorithm for the problem of scheduling sporadic tasks with preemption delays. Eventually, we propose an optimal offline solution to the problem of scheduling tasks subjected to preemption delays using mathematical programming.

show abstract

OUTSTANDING PAPER: Evaluation of Cache Partitioning for Hard Real-Time Systems

Cited by 36 publications

References 23 publications

Response-time analysis for fixed-priority systems with a write-back cache

Response-time analysis for fixed-priority systems with a write-back cache

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Online and offline scheduling with cache-related preemption delays

Contact Info

Product

Resources

About