Multi-level unified caches for probabilistically time analysable real-time systems
Visualitza/Obre
Multi-level Unified Caches for Probabilistically Time Analysable Real-Time Systems (403,7Kb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/22544
Tipus de documentText en actes de congrés
Data publicació2013
EditorIEEEXPLORE
Condicions d'accésAccés restringit per política de l'editorial
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Caches are key resources in high-end processor architectures to increase performance. In fact, most high-performance processors come equipped with a multi-level cache hierarchy. In terms of guaranteed performance, however, cache hierarchies severely challenge the computation of tight worst-case execution time (WCET) estimates. On the one hand, the analysis of the timing behaviour of a single level of cache is already challenging, particularly for data accesses. On the other hand, unifying data and instructions in each level, makes the problem of cache analysis significantly more complex requiring tracking simultaneously data and instruction accesses to cache. In this paper we prove that multi-level cache hierarchies can be used in the context of Probabilistic Timing Analysis and tight WCET estimates can be obtained. Our detailed analysis (1) covers unified data and instruction caches, (2) covers different cache-write policies (write-through and write back), write allocation policies (write-allocate and non-write-allocate) and several inclusion mechanisms (inclusive, non-inclusive and exclusive caches), and (3) scales to an arbitrary number of cache levels. Our results show that the probabilistic WCET (pWCET) estimates provided by our analysis technique effectively benefit from having multi-level caches. For a two-level cache configuration and for EEMBC benchmarks, pWCET reductions are 55% on average (and up to 90%) with respect to a processor with a single level of cache.
CitacióKosmidis, L. [et al.]. Multi-level unified caches for probabilistically time analysable real-time systems. A: IEEE Real-Time Systems Symposium. "2013 IEEE 34th Real-Time Systems Symposium (RTSS 2013): 3-6 December 2013: Vancouver, Canada". Vancouver: IEEEXPLORE, 2013, p. 360-371.
ISBN978-147992007-5
Versió de l'editorhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6728890&tag=1
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Multi-level Uni ... able Real-Time Systems.pdf | Multi-level Unified Caches for Probabilistically Time Analysable Real-Time Systems | 403,7Kb | Accés restringit |