Component-level models

System
Description
System parameters
Resources parameters
Workload parameters
service demands
workload intensity

MODEL

Performance
Measures

Queuing
Network Model
Response time
Throughput
Utilization
Queue length

Montlo upologistiko sustmato

Esodoi -

Forto (workload)

ntash fortou (workload intensity)

apaitsei exuphrthsh (service demands)
'Exodoi -

Dekte epdosh

bajm qrhsimopohsh
rujm apdosh
qrno apkrish
mso arijm ergasin


/

- (load independent)
- (load dependent)

Sumbolismo
Ma Kathgora

Arijm stajmn sto ssthma.

vi

Mso arijm episkyewn mia ergasa sto stajm

ti

Msh apathsh (qrno ) exuphrthsh an epskeyh mia ergasa sto

stajm

di

i.

i.

Msh sunolik apathsh exuphrthsh ma ergasa sto stajm

Isqei

di = viti.

i.

wi

Mso qrno paramon (anamon+exuphrthsh) an epskeyh mia ergasa sto stajm

ri

i.

Mso sunolik qrno paramon mia ergasa sto stajm

i.

Isqei

r i = vi wi .
T

Mso qrno apkrish tou sustmato . Isqei

Rujm apdosh tou stajmo

i.

Sunolik rujm apdosh tou sustmato (sumpptei me ton mso rujm afxewn gia anoikt dktuo). Isqei

P
P
T = i vi wi = i r i .

Bajm qrhsimopohsh tou stajmo

i.

i = vi.

Isqei

i = iti = di.

ni

Mso arijm ergasin sto stajm

tou

i.

Isqei

ni = iwi = ri

(Tpo

Little).

Mso sunolik arijm ergasin sto ssthma. Isqei

Gia kleist dktuo

stajer (plhjusm ).

P
N = i ni = T .

Poll Kathgore

R
vij

Arijm kathgorin ergasin sto ssthma.

Mso arijm episkyewn mia ergasa th kathgora

sto stajm

i.
tij

Msh apathsh exuphrthsh an epskeyh mia ergasa th kathgora

dij

sto stajm

i.

Msh sunolik apathsh exuphrthsh mia ergasa th kathgora

sto stajm

i.

Isqei

dij = vij tij .

wij

Mso qrno paramon an epskeyh mia ergasa th kathgora

sto stajm

rij

Tj

ij
j

i.

Mso sunolik qrno paramon mia ergasa th kathgora

stajm

i.

Isqei

sto

rij = vij wij .

Mso qrno apkrish tou sustmato gia thn kathgora

P
P
Tj = i vij wij = i rij .

Rujm apdosh tou stajmo

gia thn kathgora

j.

Isqei

(mso

j.

Sunolik rujm apdosh tou sustmato gia thn kathgora

rujm afxewn gia anoikt dktuo). Isqei

ij = j vij .

Sunolik rujm apdosh tou sustmato (sunolik mso rujm

afxewn gia anoikt dktuo).

Isqei

k.
= [1, . . . , R ], = k
i

P j
j .

Gia anoikt dktuo

ij

Bajm qrhsimopohsh tou stajmo

nij

Mso arijm ergasin th kathgora

Nj

Mso sunolik arijm ergasin th kathgora

gia thn kathgora

j.

Isqei

ij = ij tij = j dij .
j

sto stajm

ij wij = j rij .

m ),

Nj = i nij = j Tj . Gia
k.
= [N1, . . . , NR ], N = kN
N

Isqei

kleist dktuo

Nj

i.

Isqei

nij =

sto ssthma.

stajer (plhjus-

 Jackson

(c c: - c)
l
(c c l)
M c

:
(t) = [N1(t), N2(t), . . . , NM (t)]
N
lc c l:
P
(t)k = M
N (t) = kN
i=1 Ni(t)

c:

(i) c: (N ) q0i, i =
1, 2, . . . , M ( c)

(ii) c c i:
i(ni), ni = Ni(t)
(iii) c FCFS

(iv) c lc (routing probabilities):

P +1
qij ,0 i M , 1 j M + 1, (qij 0 M
j=1 qij = 1)
(l Markov)

 c:
(t) = n
p(
n; t) = Pr[N
], n
= [n1, n2, . . . , nM ]
c:
p(
n) = limt p(
n; t)

(N ) +

M
X

i(ni)(1 qii) p(
n) =

i=1

(N 1)

M
X

q0ip(
n
1i) +

i=1
M
X

i(ni + 1)qi,M +1p(

n+
1i) +

i=1
M X
M
X

i(ni + 1)qij p(
n+
1i
1j )

j=1 i=1
i6=j

(0)p(
0) =

M
X
i=1

i(1)qi,M +1p(
1i )

{ei}, i = 1, 2, . . . , M : l c
ei = q0i +

M
X

ej qji,

i = 1, 2, . . . , M

j=1

ei: c c i c lc
c c

 (Jackson, 1963)
l G < , p(
n)
:
n

M
Y
ei i
1
p(
n) = (N )
G
i=1 Mi(ni)

(N ) =
Mi(ni) =

N
Y
n=1
ni
Y

(n 1)
i(n)

n=1

G =

M
Y

ei i
(N )
i=1 Mi(ni)
n

 c lc c (global balance)

c c c (local balance)

(product form)

c c c
((N ) = N ):
(N ) = N =

M
Y

ni

i=1

p(
n) =

M
Y

pi(ni)

i=1

:
(ei)ni
pi(ni) =
pi(0)
Mi(ni)
1

X (ei)n

pi(0) =
n=0 Mi(n)

 c:
c pi(ni) c l c M/M/1 ( M/M/c)
( Jackson, 1957)


M/M/1
: (c ), (c c)
lc: = / < 1 ( c)
:
pn = (1 )n, n = 0, 1, . . .
c c : E[n] = /(1 )
c c c: T = (1/)/(1 )
M/M/
: (c ), (c c)
lc: = /
:
n
pn = n! e , n = 0, 1, . . .
c c : E[n] =
c c c: T = 1/

l c
M
X

i(ni)(1 qii)p(
n) =

i=1

M X
M
X

i(ni + 1)qij p(
n+
1i
1j )

j=1 i=1
i6=j

{ei}, i = 1, 2, . . . , M : l c
ei =

M
X

ej qji,

i = 1, 2, . . . , M

j=1

(c c c lc Markov)

 (Gordon Newell, 1967) {ei}, i = 1, 2, . . . , M PM

l c. p(
n) k
nk = i=1 ni =
N , ni 0, :
n

M
Y
ei i
1
p(
n) =
G(N, M ) i=1 Mi(ni)

c Mi(ni) c
G(N, M ) =

X
n

k
nk=N

M
Y

ei i
i=1 Mi(ni)

G(N, M ): c (normalization constant)

 lc c lc (J.P. Buzen)
lc c c G(N, M ):
c
( c
! n
N +M 1
) c
M 1

en
i
c lc {
, n = 1, 2, . . .}:
Mi(n)
gi(z) =

X
(eiz)n
n=0 Mi(n)

i = 1, 2, . . . , M

:
g(z) =

M
Y

gi(z)

i=1

G(N, M ): lc z N g(z)

 :
1(z) = g1(z)
i(z) = i1(z)gi(z),

i = 2, 3, . . . , M

G(j, i): lc z j i(z)

jk

j
X

ei
G(j, i) =
G(k, i 1)
Mi(j k)
k=0

c lc c c G(N, M )
:
G(0, i) = 1,

i = 1, 2, . . . , M
j

e1
G(j, 1) =
,
M1(j)
O(M N 2) c c

j = 1, 2, . . . , N

 c
i(ni) = i ni > 0:
i = ei/i, i = 1, 2, . . . , M

G(j, i) =

j
X

jk

G(k, i 1)i

k=0

= G(j, i 1) +

j1
X

jk

G(k, i 1)i

k=0
j1
X

= G(j, i 1) + i

k=0

jk1

G(k, i 1)i

G(j, i) = G(j, i 1) + iG(j 1, i)

c lc c c G(N, M )
:
G(0, i) = 1,
j

G(j, 1) = 1,
O(M N ) c c

i = 1, 2, . . . , M
j = 1, 2, . . . , N

0
1
2
...

1 2
1 1
1
12
...

j 1
...
...
N 1N

i
1

M
1

G(j 1, i)
i
G(j, i 1)
G(j, i)
G(N, M )

lc c
( c i)
c c
i = i

G(N 1, M )
G(N, M )

c c
G(N 1, M )
i = ei
G(N, M )

 c c l
N
X
1
E[ni] =
G(N n, M )in
G(N, M ) n=1

c c c (c Little)
N
X
E[ni]
1
Ti =
=
G(N n, M )in
i
eiG(N 1, M ) n=1

 BCMP
F.Baskett, K.M.Chandy, R.R.Muntz, F.G.Palacios (1975)

l c

(separable)

R c l:
c
(c qir,js, q0,ir ,

c lc ll
qir,M +1)

lc: (i, r) l c lc c c c (lc c lc).

c c (N ),
N lc c l .

 Cox

c Cox:

c Laplace:
(s) = b0 +

k
X
i=1

Aibi

i
Y

j
j=1 j + s

Ai = a0 ai1 (i = 1, . . . , k) ( lc
i)
c c c Cox: 1/ =

Pk
i=1 Ai/i.

 c:

FIFO (First In First Out)

PS (Processor Sharing)

LCFSPR (Last Come First Served Preemptive Resume)

IS (Infinite Servers)
Server-per-job Delay

 :
c 1: c, c c
c i(ni) lc c c l,
ni c l , c c FCFS.
c 2: c Cox, l, c
c PS.
c 3: c c IS c c
2.
c 4: c c LCFSPR c

c c c 2 3.

l l
eir = q0,ir +

M X
R
X

ejsqjs,ir ,

1 i, j M, 1 r, s R

j=1 s=1

eir : l l c c r
i.

:
n
= [
n1, n
2 , . . . , n
M ], n
i = [ni1, ni2, . . . , niR ]
ni = k
nik =

PR
PM
n
,
N
=
r=1 ir
i=1 ni

i(ni): c c i (c lc c c
l), 1
1/ir : c c c l c c r i,

c 2,3 4

 {eir }, i = 1, 2, . . . , M , r = 1, 2, . . . , R, l
c. p(
n) G <
:
M
Y
1
p(
n) = (N )
gi(
ni)
G
i=1

( Q
N
n=1 (n 1)
(N ) =

G =

X
n

(N )

M
Y
i=1

gi(
ni)


" n #
ir

e
QR
Qni

ir

n
!
/

r=1 n !
n=1 i(n) c 1

!n #
" ir

1
eir ir
QR
gi(
ni) = ni! r=1
c 2 4

n
!

ir
ir #

"
!n

ir

1
e
Q

ir
R

c 3
r=1
nir ! ir

 c lc lc
- c c
- c i (c 1)
n
= [n1, n2, . . . , nM ]: lc c l ( lc
c c)
( P
R (e / ) c 1
ir i
i = Pr=1
R (e / ) c 2, 3 4
ir ir
r=1

p(
n) = p1(n1)p2(n2) . . . pM (nM )


ni

(1

)
c 1, 2 4
i

ni i
i
pi(ni) =

c 3
e
ni!

(i < 1 c c 1,2 4)
c c c M/M/1 ( 1,2 4)
M/M/ (c 3).

l BCMP

lc c c c G

l c c

Mean Value Analysis - MVA

M. Reiser, 1980

MVA
c c:

(i) l l c , c c c `l c lc
,
lc c l .
(arrival instant theorem) l .

(ii) c Little ll
.