Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling
Research output: Contribution to conference › Paper
Date | Published - Oct 2016 |
---|
Original language | English |
---|
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.
- real-time, cache memories, write back, write through, fixed priority scheduling, response time analysis
Prize: Prize (including medals and awards)
Discover related content
Find related publications, people, projects, datasets and more using interactive charts.
View graph of relations