Title: Measurement-Based Probabilistic Timing Analysis for Multi-path Programs
Abstract: The rigorous application of static timing analysis requires a large and costly amount of detail knowledge on the hardware and software components of the system. Probabilistic Timing Analysis has potential for reducing the weight of that demand. In this paper, we present a sound measurement-based probabilistic timing analysis technique based on Extreme Value Theory. In all the experiments made as part of this work, the timing bounds determined by our technique were less than 15% pessimistic in comparison with the tightest possible bounds obtainable with any probabilistic timing analysis technique. As a point of interest to industrial users, our technique also requires a comparatively low number of measurement runs of the program under analysis, less than 650 runs were needed for the benchmarks presented in this paper.
Publication Year: 2012
Publication Date: 2012-07-01
Language: en
Type: preprint
Indexed In: ['crossref']
Access and Citation
Cited By Count: 231
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot