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.
Type de document :
Communication dans un congrès
ARCS 2015 - International Conference on Architecture of Computing Systems, Mar 2015, Porto, Portugal. 9017, pp.236-247, Lecture Notes in Computer Science 〈10.1007/978-3-319-16086-3_19〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01235544
Contributeur : Damien Hardy <>
Soumis le : lundi 30 novembre 2015 - 11:53:49
Dernière modification le : mardi 16 janvier 2018 - 15:54:17

Identifiants

Citation

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. 9017, pp.236-247, Lecture Notes in Computer Science 〈10.1007/978-3-319-16086-3_19〉. 〈hal-01235544〉

Partager

Métriques

Consultations de la notice

304