• Aucun résultat trouvé

Slides

N/A
N/A
Protected

Academic year: 2022

Partager "Slides"

Copied!
12
0
0

Texte intégral

(1)

Information Theory (2)

Some Applications in Computer Science

Jean-Marc Vincent

MESCAL-INRIA Project Laboratoire d’Informatique de Grenoble

Universities of Grenoble, France [email protected] LICIA - joint laboratory LIG -UFRGS

This work was partially supported by CAPES/COFECUB

(2)

Modeling Application

EVALUATION RESULTS control Simulation/Execution

Output analysis generator

Environment description

Workload

Simulation/Execution Kernel Modelling

Model description

functions,...

automata, algorithms,

SYSTEM

(3)

Workload generation problem (2)

- sequence of events - marks on events Generated load

THE SYSTEM STATE OF KERNEL

0110010101110...

INJECTOR Random Generator Random seed

Temporal behaviour

Elapsed time

Distribution

Quantitative profile

Amount

Size

3 4

1

Amount

Types Structure profile

2 Load profiler

WORKLOAD GENERATOR

(4)

Observations (example)

Consider a Web server, 4 types of requests A, B, C, D.

Basic Question

Build a stochastic model of the workload :

Without any other assumptions, we assume the workload be:

- a stochastic sequence ofindependentanduniformlydistributed random variables on{A,B,C,D}

Some more assumptions For each type of request

Type of request A B C D

Average processing time (s) 10 4 3 1 Observation :

The average processing time ofNrequests isNT withT =6 Build a stochastic model of the workload

(5)

MaxEnt Principle

Observation

Partial information on the system stateX: FunctionΦand we observe

Eφ(X).

Examples :

φ(x) =1 normalization;

φ(x) =xaverage state;

φ(x) =log(x)order of magnitude;

φ(x) =11X>αthreshold constraint...

The total information on the system is given by C={(φj,aj),j=0,1, ...,m},

j(x) =aj,

Convention :φ0=1 anda0=1

(6)

MaxEnt Principle

Principle

Under the set of constraints C={(φj,aj),j=0,1, ...,m},

model the system by the distribution maximizing H(X) =X

i

pi(−log2pi)

underC.

Minimize the a priori information inside the model description Uniform distribution is the 0-knowledge hypothesis

Computable form of the distribution Danger : such a distribution may not exist

(7)

Application of MaxEnt Principle

Maximize entropy of the model under constraints (Φ0) pA+pB+pC+pD =1,

1) 10pA+4pB+3pC+pD =6.

Using Lagrange multipliers g(p, λ0, λ1) =X

pi(−logpi) +λ0(X

pi−1) +λ1(X

Tipi−T).

∂g

∂pi

=−logpi−1+λ01Ti, and

pi=2λ0−1+λ1Ti.

(8)

Application of MaxEnt Principle

Using constraints PTi2λ1Ti

P2λ1Ti =T.

2 2

4 6 8 10

−2 −1.5 −1 −0.5 0 0.5 1 1.5

0

λ1=0.1712

Type of request A B C D

Average processing time (s) 10 4 3 1

Probability 0.44 0.22 0.19 0,15

(9)

Classical laws

Integer valued variable on{0,1,2,· · ·,n}

No constraints : uniform distribution φ1(x) =xaverage constraint

pi= 1ρ 1ρn+1ρi, Geometric distribution Extends toN

(10)

Continuous Variables

Continuous Variable Entropy

ForXrandom variable with densityfXwe define

H(X) = Z

(−logfX(x))fX(x)dx.

The properties ofHare almost the same as for discrete distributions (positivity fails)

Gibbs distributions

A random variable has a Gibbs distribution when the density has the form

f(x) =exp

m

X

j=0

λjφj(x)

 ,

play a central role in statistics

exponential, Gaussian,... are Gibbs distributions

(11)

Optimal distributions

Gibbs densities are MaxEnt distributions

Suppose that there is a Gibbs distribution ofXsatisfying the constraints C={(φj,aj),j=1, ...,m}.

thenXhas the maximum entropy distribution underC.

Uniform distribution is MaxEnt under constraintX[a,b]

Exponential distribution is MaxEnt under constraintEX=m

Normal distribution is MaxEnt under constraintEX=mandVar X=σ2 Poisson process, Markov process, etc.

(12)

Synthesis

For modeling systems

establish the knowledge on your system parameters (fixed or variable) establish what is really random

establish the knowledge on the random part (put the constraints)

apply the MaxEnt principle (use independence if there are no correlations) generate/analyse your workload

Generalization

Combinatorial structures

Non uniforme reference distribution (Gaussian) ...

References

Cover, T. and Thomas, J. (2006),Elements of Information Theory2nd Edition, Wiley-Interscience

E. T. Jaynes, “Information Theory and Statistical Mechanics,” Physical Review, vol. 106, no. 4, pp. 620-630; May 15, 1957.

Références

Documents relatifs

Under the parallel projection, if each line edge in a connected cycle of 3D edges is. not perpendicular to the projection plane, then the projection of the closed cycle of 3D edges

Figure 12 shows the laboratory mean estimates for sample E in log 10 copies/mL and NAT detectable units/ mL for the qualitative datasets (1, 10, 11, 15 and 16), using data obtained

Keller-Segel model; chemotaxis; large time asymptotics; subcritical mass; self-similar so- lutions; relative entropy; free energy; Lyapunov functional; spectral gap;

We show that the random stable lamination can be coded by the continuous-time height function associated to the normalized excursion of a strictly stable spectrally positive

By working with multidisciplinary teams in community-based and com- munity board–directed centres, fam- ily physicians in Ontario community health centres (CHCs)

By working with multidisciplinary teams in community-based and com- munity board–directed centres, fam- ily physicians in Ontario community health centres (CHCs)

A large portion of this course deals with methods that are used to determine how much of a material is present.. We need to review the general steps that are taken for

Establish the mass-radius relation in n=3/2 polytropic spheres of completely degenerated non-relativistic gas and the Chandrasekhar limiting mass of a n=3 polytropic