You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Cache-aware response time analysis for real-time tasks with fixed preemption points
Publication Type:
Conference/Workshop Paper
Venue:
The 26TH IEEE Real-time and embedded Technology and Applications Symposium
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.
Bibtex
@inproceedings{Markovic5769,
author = {Filip Markovic and Jan Carlson and Radu Dobrin},
title = {Cache-aware response time analysis for real-time tasks with fixed preemption points},
month = {April},
year = {2020},
booktitle = {The 26TH IEEE Real-time and embedded Technology and Applications Symposium},
url = {http://www.es.mdu.se/publications/5769-}
}