Analysis of Probabilistic Cache Related Pre-emption Delays

Davis, Robert I.; Santinelli, Luca; Altmeyer, Sebastian; Maïza, Claire; Cucu-Grosjean, Liliana

doi:10.1109/ecrts.2013.27

Cited by 53 publications

(51 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As demonstrated for random-replacement caches [9], these do not guarantee the ETP observed at the access or basic block level are independent, i.e. una↵ected by prior accesses.…”

Section: Independent Block Modelmentioning

confidence: 99%

“…Consider as an example a single cache with an evict-on-access randomised replacement policy [9]. We access memory block m present in the input cache.…”

Section: Probabilistic Execution Timementioning

confidence: 99%

“…The resulting cache hits and misses across the memory hierarchy are used to estimate the temporal behaviour of each call to the function. We modified Cachegrind to support the evict-on-miss random replacement policy [9] and to construct of the CFG of the instrumented program.…”

Section: Gathering Basic Block Measurementsmentioning

confidence: 99%

See 2 more Smart Citations

A framework for the evaluation of measurement-based timing analyses

Lesage

Griffin

Soboczenski

et al. 2015

Proceedings of the 23rd International Conference on Real Time and Networks Systems

Self Cite

View full text Add to dashboard Cite

A key issue with Worst-Case Execution Time (WCET) analyses is the evaluation of the tightness and soundness of the results produced. In the absence of a ground truth, i.e. the Actual WCET (AWCET), such evaluations rely on comparison between di↵erent estimates or observed values.In this paper, we introduce a framework for the evaluation of measurement-based timing analyses. This framework uses abstract models of synthetic tasks to provide realistic execution time data as input to the analyses, while ensuring that a corresponding AWCET can be computed. The effectiveness of the framework is demonstrated by evaluating the impact of imperfect structural coverage on an existing measurement-based probabilistic timing analysis.

show abstract

“…As demonstrated for random-replacement caches [9], these do not guarantee the ETP observed at the access or basic block level are independent, i.e. una↵ected by prior accesses.…”

Section: Independent Block Modelmentioning

confidence: 99%

“…Consider as an example a single cache with an evict-on-access randomised replacement policy [9]. We access memory block m present in the input cache.…”

Section: Probabilistic Execution Timementioning

confidence: 99%

See 1 more Smart Citation

A framework for the evaluation of measurement-based timing analyses

Lesage

Griffin

Soboczenski

et al. 2015

Proceedings of the 23rd International Conference on Real Time and Networks Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…This analysis was based on the reuse distance of memory accesses. It was superseded by analysis for the more effective evict-on miss policy (which dominates the evict-on-access approach assumed by previous papers) [19]. In 2014, a more effective SPTA [4] was introduced based on cache contention, and a precise analysis of a limited set of focussed cache blocks.…”

Section: Related Workmentioning

confidence: 99%

Study of the reliability of statistical timing analysis for real-time systems

Maxim¹,

Soboczenski

Bate

et al. 2015

Proceedings of the 23rd International Conference on Real Time and Networks Systems

View full text Add to dashboard Cite

Probabilistic and statistical temporal analyses have been developedas a means of determining the worst-case execution and responsetimes of real-time software for decades. A number of such methodshave been proposed in the literature, of which the majority claim tobe able to provide worst-case timing scenarios with respect to agiven likelihood of a certain value being exceeded. Further, suchclaims are based on either some estimates associated with a probability,or probability distributions with a certain level of confidence.However, the validity of the claims are very much dependent on anumber of factors, such as the achieved samples and the adopteddistributions for analysis.In this paper, we investigate whether the claims made are in facttrue as well as the establishing an understanding of the factors thataffect the validity of these claims. The results are of importancefor two reasons: to allow researchers to examine whether there areimportant issues that mean their techniques need to be refined; andso that practitioners, including industrialists who are currently usingcommercial timing analysis tools based on these types of techniques,understand how the techniques should be used to ensure theresults are fit for their purposes. Study of the Reliability of Statistical Timing Analysis forReal-Time Systems ABSTRACTProbabilistic and statistical temporal analyses have been developed as a means of determining the worst-case execution and response times of real-time software for decades. A number of such methods have been proposed in the literature, of which the majority claim to be able to provide worst-case timing scenarios with respect to a given likelihood of a certain value being exceeded. Further, such claims are based on either some estimates associated with a probability, or probability distributions with a certain level of confidence. However, the validity of the claims are very much dependent on a number of factors, such as the achieved samples and the adopted distributions for analysis. This paper is the first one that puts side by side existing state of the art statistical and probabilistic analysis techniques, using the probabilistic analysis as the ground truth in order to asses the applicability and performance of the statistical technique. The evaluation clearly shows that for the experiments performed the approach can identify clear differences between a range of techniques and that these differences can be considered valid based on the trends expected from the academic theory.

show abstract

“…A fully-associate cache with random replacement is one example that can be used for PTA. Along this line of research, PTA has been applied to a single level cache [Kosmidis et al 2013a], multi-level caches [Kosmidis et al 2013b] and for CRPD [Davis et al 2013]. Recently, PTA was used for shared caches to estimate the inter-core cache conflicts [Slijepcevic et al 2014].…”

Section: Future Directionsmentioning

confidence: 99%

A Survey on Cache Management Mechanisms for Real-Time Embedded Systems

et al. 2015

View full text Add to dashboard Cite

Multicore processors are being extensively used by real-time systems, mainly because of their demand for increased computing power. However, multicore processors have shared resources that affect the predictability of real-time systems, which is the key to correctly estimate the worst-case execution time of tasks. One of the main factors for unpredictability in a multicore processor is the cache memory hierarchy. Recently, many research works have proposed different techniques to deal with caches in multicore processors in the context of real-time systems. Nevertheless, a review and categorization of these techniques is still an open topic and would be very useful for the real-time community. In this article, we present a survey of cache management techniques for real-time embedded systems, from the first studies of the field in 1990 up to the latest research published in 2014. We categorize the main research works and provide a detailed comparison in terms of similarities and differences. We also identify key challenges and discuss future research directions.

show abstract

Analysis of Probabilistic Cache Related Pre-emption Delays

Cited by 53 publications

References 14 publications

A framework for the evaluation of measurement-based timing analyses

A framework for the evaluation of measurement-based timing analyses

Study of the reliability of statistical timing analysis for real-time systems

A Survey on Cache Management Mechanisms for Real-Time Embedded Systems

Contact Info

Product

Resources

About