Speeding up Static Probabilistic Timing Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Speeding up Static Probabilistic Timing Analysis

Abstract

Probabilistic Timing Analysis (PTA) has emerged recently to derive trustworthy and tight WCET estimates. Computational costs due to the use of the mathematical operator called convolution used by SPTA – the static variant of PTA – and also deployed in many domains including signal and image processing, jeopardize the scalability of SPTA to real-size programs. We evaluate, qualitatively and quantitatively, optimizations to reduce convlution’s computational costs when it is applied to SPTA. We showthat SPTA specific optimizations provide the largest execution time reductions, at the cost of a small loss of precision.
No file

Dates and versions

hal-01235544 , version 1 (30-11-2015)

Identifiers

Cite

Milutinovic Suzana, Jaume Abella, Damien Hardy, Eduardo Quinones, Isabelle Puaut, et al.. Speeding up Static Probabilistic Timing Analysis. ARCS 2015 - International Conference on Architecture of Computing Systems, Mar 2015, Porto, Portugal. pp.236-247, ⟨10.1007/978-3-319-16086-3_19⟩. ⟨hal-01235544⟩
229 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More