cloud computing modeling
TRANSCRIPT
-
8/3/2019 Cloud Computing Modeling
1/31
MODELING OF CLOUD
M/G/M QUEUES
HAMZEH KHAZAEI
UNIVERSITY OF MANITOBADEPARTMENT
OF COMPUTER SCIENCE
OCT 28, 2010
-
8/3/2019 Cloud Computing Modeling
2/31
2 /30Agenda
Introduction
Modeling of a Cloud Center
Performance Metrics
mu a on Results
Conclusion
-
8/3/2019 Cloud Computing Modeling
3/31
3 /30Introduction to Cloud Computing Cloud Computing, CC, is a computing paradigm, in
which diff. computing resources, such as,infrastructure, platforms and software applicationsare made accessible, over internet to remote user
.
Delivery as service: so QoS is essential.
QoS has multiple dimensions: response time,
throughput, availability, reliability, and security. Service Level Agreement, SLA: negotiated and
agreed btw customers and service providers
-
8/3/2019 Cloud Computing Modeling
4/31
4 /30Introduction
Our Contribution so far:
an ana ytica mo efor
performance evaluation
-
8/3/2019 Cloud Computing Modeling
5/31
5 /30High level schematic of CC
Cloud Centers: could be viewed as a single point of
access
-
8/3/2019 Cloud Computing Modeling
6/31
-
8/3/2019 Cloud Computing Modeling
7/31
7 /30A little bit on M/G/m
So far, there is no exact and close form steady-
state solution for M/G/m queues. So approximation methods are sought.
,
useful for our purpose. (why?)
Most of them are accurate for small value of m, let
say less that 20. And almost all of them lead to reasonable results if
coefficient of variation, CV, is less than unity.
So we needed to develop our model
-
8/3/2019 Cloud Computing Modeling
8/31
8 /30A little bit on Stochastic Process
-
8/3/2019 Cloud Computing Modeling
9/31
9 /30Analytical Model
M/G/m queuing system is used for modeling.
Embedded Markov Chain, EMC is employed tomodel the system.
moments.
The points of arriving instants are selected as
Markov points. (they have Markov property)
-
8/3/2019 Cloud Computing Modeling
10/31
10 /30Analytical Model
-
8/3/2019 Cloud Computing Modeling
11/31
11 /30Markov Chain
-
8/3/2019 Cloud Computing Modeling
12/31
12 /30
Formal Definitions
Due to ergodicity of the Markov chain, an
equilibrium probability distribution exists for thenumber of tasks in system at arrivals:
In other words, we need to solve following
equations:
In which and P is the one-steptransition matrix.
So immediate step would be finding matrix P.
-
8/3/2019 Cloud Computing Modeling
13/31
13 /30
Formal Definitions
Cumulative Distribution Function, CDF, of Service
time & arrival: B(x) & A(x) Laplace-Stieltjes Transform, LST, of service time:
B* s
Mean service time: b=1/
We indicate remaining service time, as B+ and
elapsed service time as B-
It can be shown that both of them has the same
probability distribution function as well as LST:
-
8/3/2019 Cloud Computing Modeling
14/31
14 /30
More details on the system behavior
-
8/3/2019 Cloud Computing Modeling
15/31
15 /30
Formal Definitions
The probability of having first departure in a busy
server:
The probability of having first departure in an idle
server:
The probability of having k>=1 departures in a
busy server:
-
8/3/2019 Cloud Computing Modeling
16/31
16 /30
Transition Probabilities
-
8/3/2019 Cloud Computing Modeling
17/31
17 /30
Transition Probabilities
Regarding region labeled (1): pij=0
Region (2):
Region (3):
-
8/3/2019 Cloud Computing Modeling
18/31
18 /30
Transition Probabilities
And finally region (4):
-
8/3/2019 Cloud Computing Modeling
19/31
19 /30
Equilibrium Balance Equations
Now we have the balance equations:
or numer ca so u on we runca e a ance
equations:
Normalization equation:
-
8/3/2019 Cloud Computing Modeling
20/31
20 /30
Distribution of no. of tasks in system
Now, we can establish PGF of number of tasks in
the system at arrival instant:
Based on PASTA, distribution of tasks in system at
arrival is identical with any arbitrary moment of
time:
-
8/3/2019 Cloud Computing Modeling
21/31
21 /30
Performance metrics
Mean number of tasks in the system:
Mean response time, by Little's law:
-
8/3/2019 Cloud Computing Modeling
22/31
22 /30
Distribution of Waiting & Response Time
If W denotes the waiting time in queue in
equilibrium, W(x), W*(s) be the CDF and LSTrespectively.
And if Q z indicates the PGF of number of tasks in
queue in steady-state. We have:
The left hand side of above equation is:
-
8/3/2019 Cloud Computing Modeling
23/31
23 /30
Distribution of Waiting & Response Time
So we have the LST of waiting time in queue as:
n we now:
We also can have higher moments of response time:
-
8/3/2019 Cloud Computing Modeling
24/31
24 /30
A little bit on Simulation
-
8/3/2019 Cloud Computing Modeling
25/31
25 /30
Results
-
8/3/2019 Cloud Computing Modeling
26/31
26 /30
Results
-
8/3/2019 Cloud Computing Modeling
27/31
27 /30
Results Response tiem
-
8/3/2019 Cloud Computing Modeling
28/31
28 /30
Results Response time
-
8/3/2019 Cloud Computing Modeling
29/31
29 /30
Results higher moments
-
8/3/2019 Cloud Computing Modeling
30/31
30 /30
Results higher moments
-
8/3/2019 Cloud Computing Modeling
31/31
31 /30
Thank You !!!Any Question?