Paper Info
Title
Cache-aware response time analysis for real-time tasks with fixed preemption points
Abstract
In real-time systems that employ preemptive scheduling and cache architecture, it is essential to account as precisely as possible for cache-related preemption delays in the schedulability analysis, as an imprecise estimation may falsely deem the system unschedulable. In the current state of the art for preemptive scheduling of tasks with fixed preemption points, the existing schedulability analysis considers overly pessimistic estimation of cache-related preemption delay, which eventually leads to overly pessimistic schedulability results. In this paper, we propose a novel response time analysis for real-time tasks with fixed preemption points, accounting for a more precise estimation of cache-related preemption delays. The evaluation shows that the proposed analysis significantly dominates the existing approach by being able to always identify more schedulable tasksets.
Year
DOI
Venue
2020
10.1109/RTAS48715.2020.00-19
2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)
Keywords
DocType
ISSN
Real-time Systems,Cache-related preemption delay (CRPD),Fixed-Priority scheduling,Preemptive Scheduling,Cache Memory
Conference
1545-3421
ISBN
Citations 
PageRank 
978-1-7281-5500-5
0
0.34
References 
Authors
17
3
Name
Order
Citations
PageRank
Filip Markovic100.68
Jan Carlson241641.20
Radu Dobrin316922.41