Evaluation of Cache Partitioning for Hard Real-Time Systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Evaluation of Cache Partitioning for Hard Real-Time Systems. / Altmeyer, Sebastian; Douma, Roeland; Lunniss, Will; Davis, Robert Ian.

Real-Time Systems (ECRTS): 2014 26th Euromicro Conference on. IEEE, 2014. p. 15-26.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Altmeyer, S, Douma, R, Lunniss, W & Davis, RI 2014, Evaluation of Cache Partitioning for Hard Real-Time Systems. in Real-Time Systems (ECRTS): 2014 26th Euromicro Conference on. IEEE, pp. 15-26, 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), United Kingdom, 8/07/14. https://doi.org/10.1109/ECRTS.2014.11

APA

Altmeyer, S., Douma, R., Lunniss, W., & Davis, R. I. (2014). Evaluation of Cache Partitioning for Hard Real-Time Systems. In Real-Time Systems (ECRTS): 2014 26th Euromicro Conference on (pp. 15-26). IEEE. https://doi.org/10.1109/ECRTS.2014.11

Vancouver

Altmeyer S, Douma R, Lunniss W, Davis RI. Evaluation of Cache Partitioning for Hard Real-Time Systems. In Real-Time Systems (ECRTS): 2014 26th Euromicro Conference on. IEEE. 2014. p. 15-26 https://doi.org/10.1109/ECRTS.2014.11

Author

Altmeyer, Sebastian ; Douma, Roeland ; Lunniss, Will ; Davis, Robert Ian. / Evaluation of Cache Partitioning for Hard Real-Time Systems. Real-Time Systems (ECRTS): 2014 26th Euromicro Conference on. IEEE, 2014. pp. 15-26

Bibtex - Download

@inproceedings{1307ac9008504df3ab816fef56bf1754,
title = "Evaluation of Cache Partitioning for Hard Real-Time Systems",
abstract = "In hard real-time systems, cache partitioning isoften suggested as a means of increasing the predictabilityof caches in pre-emptively scheduled systems: when a task isassigned its own cache partition, inter-task cache eviction isavoided, and timing verification is reduced to the standard worstcaseexecution time (WCET) analysis used in non-pre-emptivesystems. The downside of cache partitioning is the potentialincrease in execution times.In this paper, we evaluate cache partitioning for hard realtimesystems in terms of overall schedulability. To this end, weexamine the sensitivity of task execution times to the size ofthe cache partition allocated and present a cache partitioningalgorithm that is optimal with respect to taskset schedulability.We then evaluate the performance of cache partitioning comparedto state-of-the-art pre-emption cost analysis based on benchmarkcode and on a large number of synthetic tasksets. This allowsus to derive general conclusions about the usability of cachepartitioning and identify taskset and system parameters thatinfluence the relative eectiveness of cache partitioning.",
author = "Sebastian Altmeyer and Roeland Douma and Will Lunniss and Davis, {Robert Ian}",
year = "2014",
month = "7",
doi = "10.1109/ECRTS.2014.11",
language = "English",
isbn = "9781479957972",
pages = "15--26",
booktitle = "Real-Time Systems (ECRTS)",
publisher = "IEEE",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

T1 - Evaluation of Cache Partitioning for Hard Real-Time Systems

AU - Altmeyer, Sebastian

AU - Douma, Roeland

AU - Lunniss, Will

AU - Davis, Robert Ian

PY - 2014/7

Y1 - 2014/7

N2 - In hard real-time systems, cache partitioning isoften suggested as a means of increasing the predictabilityof caches in pre-emptively scheduled systems: when a task isassigned its own cache partition, inter-task cache eviction isavoided, and timing verification is reduced to the standard worstcaseexecution time (WCET) analysis used in non-pre-emptivesystems. The downside of cache partitioning is the potentialincrease in execution times.In this paper, we evaluate cache partitioning for hard realtimesystems in terms of overall schedulability. To this end, weexamine the sensitivity of task execution times to the size ofthe cache partition allocated and present a cache partitioningalgorithm that is optimal with respect to taskset schedulability.We then evaluate the performance of cache partitioning comparedto state-of-the-art pre-emption cost analysis based on benchmarkcode and on a large number of synthetic tasksets. This allowsus to derive general conclusions about the usability of cachepartitioning and identify taskset and system parameters thatinfluence the relative eectiveness of cache partitioning.

AB - In hard real-time systems, cache partitioning isoften suggested as a means of increasing the predictabilityof caches in pre-emptively scheduled systems: when a task isassigned its own cache partition, inter-task cache eviction isavoided, and timing verification is reduced to the standard worstcaseexecution time (WCET) analysis used in non-pre-emptivesystems. The downside of cache partitioning is the potentialincrease in execution times.In this paper, we evaluate cache partitioning for hard realtimesystems in terms of overall schedulability. To this end, weexamine the sensitivity of task execution times to the size ofthe cache partition allocated and present a cache partitioningalgorithm that is optimal with respect to taskset schedulability.We then evaluate the performance of cache partitioning comparedto state-of-the-art pre-emption cost analysis based on benchmarkcode and on a large number of synthetic tasksets. This allowsus to derive general conclusions about the usability of cachepartitioning and identify taskset and system parameters thatinfluence the relative eectiveness of cache partitioning.

U2 - 10.1109/ECRTS.2014.11

DO - 10.1109/ECRTS.2014.11

M3 - Conference contribution

SN - 9781479957972

SP - 15

EP - 26

BT - Real-Time Systems (ECRTS)

PB - IEEE

ER -