Proceedings of the 20th International Conference on Real-Time and Network Systems 2012
DOI: 10.1145/2392987.2393001
|View full text |Cite
|
Sign up to set email alerts
|

Re-sampling for statistical timing analysis of real-time systems

Abstract: Guaranteeing timing constraints is the main purpose of analyses for real-time systems. The satisfaction of these constraints may be verified with probabilistic methods (relying on statistical estimations of certain task parameters) offering both hard and soft guarantees. In this paper, we address the problem of sampling applied to the distributions of worst-case execution times. The pessimism of presented sampling techniques is then evaluated at the level of response times.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 31 publications
(23 citation statements)
references
References 19 publications
0
23
0
Order By: Relevance
“…task on priority level 5 in this case. Five tasks per task set and five values per random variable is enough to have significant results without the need to use approximation techniques such as re-sampling [35] to speed up the probabilistic analysis. Indeed, the probabilistic analysis is highly time consuming and a way to make it tractable is to use techniques such as re-sampling, but this kind of techniques introduces inaccuracy in the obtained results, and we are interested in having an exact theoretical response time distribution that matches the empirical distribution of response times observed during simulation.…”
Section: Evaluation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…task on priority level 5 in this case. Five tasks per task set and five values per random variable is enough to have significant results without the need to use approximation techniques such as re-sampling [35] to speed up the probabilistic analysis. Indeed, the probabilistic analysis is highly time consuming and a way to make it tractable is to use techniques such as re-sampling, but this kind of techniques introduces inaccuracy in the obtained results, and we are interested in having an exact theoretical response time distribution that matches the empirical distribution of response times observed during simulation.…”
Section: Evaluation Resultsmentioning
confidence: 99%
“…The analysis is proven to be bounded in time and exact for both cases when the system utilisation is lower or greater than one. Due to the resource costs (computation time and memory) of convolution, the proposed analysis can only be applied for small task systems -this problem was later studied in [40] and [35] with the introduction and refinement, respectively, of resampling techniques meant to decrease the size of the distributions that are convolved while introducing minimal pessimism.…”
Section: Probabilistic Timing Analysismentioning
confidence: 99%
“…An example of such schedulability thresholds is presented in Table III which also presents the degradation of tasks' failure thresholds as the criticality of the system increases. For example, a task of criticality 1 is allowed to have a DMP of 0.1 in system Table III PERMITTED DEADLINE MISS PROBABILITY THRESHOLDS FOR THE TASK A note on complexity: it is well known that probabilistic analyses are computationally intensive [11] and the analysis we propose in this paper makes no exception. Nevertheless there are efficient solutions in the literature to go around this problem, such as re-sampling [11].…”
Section: B Pmc Sufficient Schedulability Testmentioning
confidence: 99%
“…For example, a task of criticality 1 is allowed to have a DMP of 0.1 in system Table III PERMITTED DEADLINE MISS PROBABILITY THRESHOLDS FOR THE TASK A note on complexity: it is well known that probabilistic analyses are computationally intensive [11] and the analysis we propose in this paper makes no exception. Nevertheless there are efficient solutions in the literature to go around this problem, such as re-sampling [11]. We do not go into details about complexity and ways of reducing it, as we rather use simple task-sets to exemplify our technique and provide a proof of concept.…”
Section: B Pmc Sufficient Schedulability Testmentioning
confidence: 99%
“…In [25] the authors compare three different approaches for re-sampling discrete probability distributions characterizing task execution times. Re-sampling is used to combat the complexity when performing exact schedulability analysis on probability distributions.…”
Section: Related Workmentioning
confidence: 99%