A MIXED MODEL FOR ESTIMATING THE PROBABILISTIC WORST CASE EXECUTION TIME Cristian MAXIM*, Adriana GOGONEL, Liliana CUCU-GROSJEAN INRIA Paris-Rocquencourt,

Slides:

Advertisements

Similar presentations

THE CENTRAL LIMIT THEOREM

Advertisements

Multi-Attribute Spaces: Calibration for Attribute Fusion and Similarity Search University of Oxford 5 th December 2012 Walter Scheirer, Neeraj Kumar, Peter.

Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.

Probabilistic models Haixu Tang School of Informatics.

Random Variables ECE460 Spring, 2012.

SE503 Advanced Project Management Dr. Ahmed Sameh, Ph.D. Professor, CS & IS Project Uncertainty Management.

Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.

Statistics review of basic probability and statistics.

Sampling Distributions (§ )

THE CENTRAL LIMIT THEOREM The “World is Normal” Theorem.

Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.

Towards optimal priority assignments for real-time tasks with probabilistic arrivals and probabilistic execution times Dorin MAXIM INRIA Nancy Grand Est.

Continuous Random Variable (1). Discrete Random Variables Probability Mass Function (PMF)

HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.

Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 10 Statistical Modelling Martin Russell.

Probability Theory Part 2: Random Variables. Random Variables  The Notion of a Random Variable The outcome is not always a number Assign a numerical.

Part 4 b Forward-Backward Algorithm & Viterbi Algorithm CSE717, SPRING 2008 CUBS, Univ at Buffalo.

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )

1 Chap 5 Sums of Random Variables and Long-Term Averages Many problems involve the counting of number of occurrences of events, computation of arithmetic.

A gentle introduction to Gaussian distribution. Review Random variable Coin flip experiment X = 0X = 1 X: Random variable.

Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Continuous random variables Uniform and Normal distribution (Sec. 3.1, )

Probability and Statistics Review

The moment generating function of random variable X is given by Moment generating function.

Probability Review (many slides from Octavia Camps)

Random Variables and Probability Distributions

Continuous Probability Distribution  A continuous random variables (RV) has infinitely many possible outcomes  Probability is conveyed for a range of.

Sampling Distributions  A statistic is random in value … it changes from sample to sample.  The probability distribution of a statistic is called a sampling.

Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.

Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.

AP Statistics Chapter 9 Notes.

Statistics for Engineer Week II and Week III: Random Variables and Probability Distribution.

Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.

Random Variables. A random variable X is a real valued function defined on the sample space, X : S  R. The set { s  S : X ( s )  [ a, b ] is an event}.

MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.

Lecture 2 Basics of probability in statistical simulation and stochastic programming Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius,

Section 6-5 The Central Limit Theorem. THE CENTRAL LIMIT THEOREM Given: 1.The random variable x has a distribution (which may or may not be normal) with.

8 Sampling Distribution of the Mean Chapter8 p Sampling Distributions Population mean and standard deviation,  and   unknown Maximal Likelihood.

One Random Variable Random Process.

Mixture of Gaussians This is a probability distribution for random variables or N-D vectors such as… –intensity of an object in a gray scale image –color.

7 sum of RVs. 7-1: variance of Z Find the variance of Z = X+Y by using Var(X), Var(Y), and Cov(X,Y)

The final exam solutions. Part I, #1, Central limit theorem Let X1,X2, …, Xn be a sequence of i.i.d. random variables each having mean μ and variance.

1 Probability and Statistical Inference (9th Edition) Chapter 5 (Part 2/2) Distributions of Functions of Random Variables November 25, 2015.

Central Limit Theorem Let X 1, X 2, …, X n be n independent, identically distributed random variables with mean  and standard deviation . For large n:

1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.

Sampling Distributions Chapter 18. Sampling Distributions A parameter is a number that describes the population. In statistical practice, the value of.

Random Variables By: 1.

Application of Extreme Value Theory (EVT) in River Morphology

CLT and Levy Stable Processes John Rundle Econophysics PHYS 250

THE CENTRAL LIMIT THEOREM

Random variables (r.v.) Random variable

Probability Theory and Parameter Estimation I

IEE 380 Review.

Appendix A: Probability Theory

STATISTICS Random Variables and Distribution Functions

THE CENTRAL LIMIT THEOREM

Chapter 7: Sampling Distributions

Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.

Advanced Artificial Intelligence

CHAPTER 15 SUMMARY Chapter Specifics

6.3 Sampling Distributions

Sampling Distributions (§ )

ASV Chapters 1 - Sample Spaces and Probabilities

Random Variables and Probability Distributions

Chapter 3 : Random Variables

M248: Analyzing data Block A UNIT A3 Modeling Variation.

Experiments, Outcomes, Events and Random Variables: A Revisit

Interval Estimation Download this presentation.

1/2555 สมศักดิ์ ศิวดำรงพงศ์

Optimization under Uncertainty

Presentation transcript:

A MIXED MODEL FOR ESTIMATING THE PROBABILISTIC WORST CASE EXECUTION TIME Cristian MAXIM*, Adriana GOGONEL, Liliana CUCU-GROSJEAN INRIA Paris-Rocquencourt, France *Airbus, Toulouse Open problems in real-time computing April 4th, 2014, ULB, Brussels, Belgium

Summary About probabilities Measurement-based probabilistic time analysis (MBPTA) Genetic algorithms Our mixed model WHY MBPTA NEEDS to be IMPROVED?

Probabilities What is a distribution function? What is a probabilistic real time system? Central limit theorem Extreme value theory Independence and identical distribution (i.i.d.)

What is a probability distribution function? A function that gives the probability of a random variable to be equal to a given value Continuos random variable Probability density function (pdf) Probabilities

What is a probability distribution function? A function that gives the probability of a random variable to be equal to a given value Discrete random variable Probability mass function (pmf) Probabilities

Cumulative distribution function (cdf) It describes the probability that a real-valued random variable X with a given probability distribution will be found at a value less than or equal to x Probabilities Continuous random variable ,7 0,2 Discrete random variable

Probabilistic real-time systems (pRTS) Probabilities Offset WCET Period Deadline

Probabilistic real-time systems (pRTS) Probabilities

Probabilistic real-time systems (pRTS) Probabilities

Central Limit Theorem (CLT) Lehoczky [1992, 1995], Tia [1995], Broster [2002] It states that the sample mean is aproximatively a Gaussian distribution, given a sufficiently large sample. (gaussian distribution = normal distribution) Probabilities Tail

Extreme value theory (EVT) Estimates the probability of occurrence of extreme events, when their distribution function is unknown, based on sequences of observations. If the distribution of rescaled maxima converges, then the limit G(x) is one of the three following types: Probabilities Gumbel pdf

Independence and identical distribution (i.i.d.) In order to use EVT or CLT, the input data for these techniques has to be: Independent Identical distributed Probabilities

Probabilistic Worst Case Execution Time (pWCET) The pWCET is an upper bound on the execution times of all possible jobs of the task Probabilities

Measurement-based probabilistic timing analysis (MBPTA) Steps of applying EVT (single-path programs) Observations Grouping Fitting Comparison Tail extension MBPTA -Tested to be i.i.d. -A fair amount of observation is needed -The input data should vary

Measurement-based probabilistic timing analysis (MBPTA) Steps of applying EVT (single-path programs) Observations Grouping Fitting Comparison Tail extension MBPTA Block maxima technique

Measurement-based probabilistic timing analysis (MBPTA) Steps of applying EVT (single-path programs) Observations Grouping Fitting Comparison Tail extension MBPTA Finding the parameters for the Gumble distribution Location - μ Scale - β Shape -α

Measurement-based probabilistic timing analysis (MBPTA) Steps of applying EVT (single-path programs) Observations Grouping Fitting Comparison Tail extension MBPTA

Measurement-based probabilistic timing analysis (MBPTA) Steps of applying EVT (single-path programs) Observations Grouping Fitting Comparison Tail extension MBPTA

Measurement-based probabilistic timing analysis (MBPTA) The MBPTA ensures safeness (tight and pessimistic bound on WCET) with respect to the input data How we build representative input data with respect to the WCET? MBPTA

Genetic Algorithms Belong to the larger class of evolutionary algorithms Used in optimization problems in order to get better solutions In our case – we use it to get a large and diversified number of inputs in order to access all paths of a program

Genetic Algorithms

A mixed model for estimating the probabilistic worst case execution time

Conclusion Experiments needed Verification of i.i.d. for both inputs and execution times Is there any corelation between the inputs and the execution times?

Thank you for your attention