TY - CONF
T1 - Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling
AU - Davis, Robert Ian
AU - Altmeyer, Sebastian
AU - Reineke, Jan
PY - 2016/10
Y1 - 2016/10
N2 - 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.
AB - 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.
KW - real-time
KW - cache memories
KW - write back
KW - write through
KW - fixed priority scheduling
KW - response time analysis
UR - https://www-users.cs.york.ac.uk/~robdavis/papers/RTNS2016_write_back.pdf
UR - https://www-users.cs.york.ac.uk/~robdavis/
UR - https://www.cs.york.ac.uk/ftpdir/reports/2016/YCS/502/YCS-2016-502.pdf
M3 - Paper
ER -