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.

BibTex Entry

@inproceedings{Davis2016a,
 author = {R.I. Davis and S. Altmeyer and J. Reineke},
 booktitle = {24th International Conference on Real-Time Networks and Systems (RTNS)},
 month = {October},
 title = {Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling},
 year = {2016}
}