Analyzing Stochastic Fixed-Priority Real-Time Systems

Gardner, Mark K.; Liu, Jane W. S.

doi:10.1007/3-540-49059-0_4

Cited by 36 publications

(31 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the algorithm is based on a bound of the processor demand of higher priority tasks, it is highly pessimistic. The next step towards an exact probabilistic analysis was made by [22] with the introduction of the Stochastic Time Demand Analysis (STDA) for tasks that have probabilistic execution times, computing a lower bound on the probability that jobs of each task will meet their respective deadlines. Later on, [21], [29], [32] refined STDA into an exact analysis for real-time systems that have random execution times.…”

Section: Probabilistic Timing Analysismentioning

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

Section: Probabilistic Timing Analysismentioning

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

show abstract

“…Papers related to this topic used different terms like stochastic analyses [2][3][4], probabilistic analyses [5] or statistical analysis [6] to indicate usually that the considered CRTES has at least one parameter defined by a random variable. In this paper we make use of the word statistic to indicate that the work is based on the theory of statistics and the word of probabilistic to indicate that the work is based on the theory of probability.…”

Section: Related Workmentioning

confidence: 99%

“…In [4,18] the authors provide the calculation of the probabilistic response time of a job under a preemptive uniprocessor fixedpriority scheduling policy as given by Equation (2).…”

Section: Probabilistic Real-time Analysismentioning

confidence: 99%

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

Maxim

Houston

Santinelli

et al. 2012

Proceedings of the 20th International Conference on Real-Time and Network Systems

View full text Add to dashboard Cite

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.

show abstract

“…The algorithm called Probabilistic Time Demand Analysis (PTDA) is based on a bound of the processor demand of higher priority tasks and hence it is highly pessimistic. The next step towards an exact probabilistic analysis was made by [5] with the introduction of the Stochastic Time Demand Analysis (STDA) for tasks that have probabilistic execution times, computing a lower bound on the probability that jobs of each task will meet their respective deadlines. Later on, [6] refined STDA into an exact analysis for real-time systems that have random execution times, represented as general random variables.…”

Section: Introductionmentioning

confidence: 99%