Improving the accuracy of cache-aware response time analysis using preemption partitioning

DOI10.4230/LIPICS.ECRTS.2020.5MaRDI QIDQ6534989zbMATH OpenFDO

Authors Filip Markoviać, Jan Carlson, Sebastian Altmeyer, Radu Dobrin

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ECRTS.2020.5

zbMATH Keywords

real-time systemsfixed-priority preemptive schedulingpreemption delay

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
• 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
• Response-time analysis for fixed-priority systems with a write-back cache
• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines

Cited in

(2)

• Performance issues in integrating temporality-based caching with prefetching
• Reducing division latency with reciprocal caches

This page was built for publication: Improving the accuracy of cache-aware response time analysis using preemption partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534989)