A synergetic approach to accurate analysis of cache-related preemption delay

The worst-case execution time (WCET) of a task denotes the largest possible execution time for all possible inputs and thus, hardware states. For non-preemptive multitask scheduling, techniques for the static estimation of safe upper bounds have been subject to industrial practice for years. For pre...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the ninth ACM International Conference on Embedded Software s. 329 - 338
Hlavní autori: Kleinsorge, Jan C., Falk, Heiko, Marwedel, Peter
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 09.10.2011
IEEE
Edícia:ACM Conferences
Predmet:
Accuracy
Cache-related Preemption Delay
Complexity theory
Delay
Estimation
General and reference > Cross-computing tools and techniques > Performance
Multitasking
Proposals
Resilience
Social and professional topics > Professional topics > Management of computing and information systems > Software management > Software selection and adaptation
Software and its engineering > Software creation and management > Software verification and validation > Formal software verification
Software and its engineering > Software organization and properties > Extra-functional properties > Software performance
Software and its engineering > Software organization and properties > Software functional properties > Formal methods
Static Analysis
Upper bound
Useful Cache Blocks
static analysis
multitasking
cache-related preemption delay
useful cache blocks
ISBN:1450307140, 9781450307147
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The worst-case execution time (WCET) of a task denotes the largest possible execution time for all possible inputs and thus, hardware states. For non-preemptive multitask scheduling, techniques for the static estimation of safe upper bounds have been subject to industrial practice for years. For preemptive scheduling however, the isolated analysis of tasks becomes imprecise as interferences among tasks cannot be considered with sufficient precision. For such scenarios, the cache-related preemption delay (CRPD) denotes a key metric as it reflects the effects of preemptions on the execution behavior of a single task. Until recently, proposals for CRPD analyses were often limited to direct mapped caches or comparably imprecise for k-way set-associative caches. In this paper, we propose how the current best techniques for CRPD analysis, which have only been proposed separately and for different aspects of the analysis can be brought together to construct an efficient CRPD analysis with unique properties. Moreover, along the construction, we propose several different enhancements to the methods employed. We also exploit that in a complete approach, analysis steps are synergetic and can be combined into a single analysis pass solving all formerly separate steps at once. In addition, we argue that it is often sufficient to carry out the combined analysis on basic block bounds, which further lowers the overall complexity. The result is a proposal for a fast CRPD analysis of very high accuracy.
ISBN:1450307140
9781450307147
DOI:10.1145/2038642.2038693