J ava M odelling T ools Marco Bertoli, Giuliano Casale, Giuseppe - - PowerPoint PPT Presentation

j ava m odelling t ools
SMART_READER_LITE
LIVE PREVIEW

J ava M odelling T ools Marco Bertoli, Giuliano Casale, Giuseppe - - PowerPoint PPT Presentation

Politecnico di Milano EECS Dept. Milan, Italy User-Friendly Approach to Capacity Planning studies with J ava M odelling T ools Marco Bertoli, Giuliano Casale, Giuseppe Serazzi 1 SIMUTOOLS09 March 5th, 2009 outline the JMT suite of


slide-1
SLIDE 1

SIMUTOOLS09 March 5th, 2009

1

Politecnico di Milano EECS Dept. Milan, Italy

User-Friendly Approach

to

Capacity Planning studies

with

Java Modelling Tools

Marco Bertoli, Giuliano Casale, Giuseppe Serazzi

slide-2
SLIDE 2

SIMUTOOLS09 March 5th, 2009

2

  • utline

the JMT suite of tools the JSIM simulator Case Study: optimal admission control

policy

slide-3
SLIDE 3

SIMUTOOLS09 March 5th, 2009

3

the JMT open source suite: six tools

slide-4
SLIDE 4

SIMUTOOLS09 March 5th, 2009

4

the JMT architecture

XML XML jSIM jSIM

JMT Tools JMT Tools JSIMwiz JSIMwiz JSIMgraph JSIMgraph

XML XML

XSLT XSLT

Visualize Status Visualize Status

“Model-View-Controller”-like pattern

Better reuse and isolation of components

Model Engine (“Controller”) Views

slide-5
SLIDE 5

SIMUTOOLS09 March 5th, 2009

5

the JSIM simulator: two graphical interfaces

JSIMgraph JSIMwiz

slide-6
SLIDE 6

SIMUTOOLS09 March 5th, 2009

6

JSIM Engine

discrete-event simulator for queueing networks several distributions (exp, Erlang, Pareto, burst/MMPP2, …) support for NPF features:

general arrival and service processes Fork-Join centers blocking and finite capacity regions priority Classes state-dependent routing:

route to least utilized center, to shortest queue route to the center with shortest response time fastest service time, round robin, random

Logger component (debugging, processing of transient data, ...)

slide-7
SLIDE 7

SIMUTOOLS09 March 5th, 2009

7

Fork-Join and Finite Capacity features

Fork and Join components

fork node: jobs are forked into P tasks Synchronization at the join node

a group of queues can be

tagged as a region with finite capacity

non-admitted jobs can be

either in a FCFS waiting buffer or dropped

slide-8
SLIDE 8

SIMUTOOLS09 March 5th, 2009

8

Statistical Analysis

Automatic removal of the initial bias

R-5 Heuristic MSER-5 Rule (Marginal Standard

Error Rule)

C.I. generation using spectral methods

Spectral Analysis [Heidelberger &

Welch, 1981]

Used also for run-length control

slide-9
SLIDE 9

SIMUTOOLS09 March 5th, 2009

9

Arrival and Service Process

Exponential insufficient for many models Pareto, Hyperexponential, Erlang, Gamma, burst

general/MMPP2, …

Custom distribution (external text file, from log,

from Logger, future JWAT)

Random number generation Mersenne Twister Load-dependent service process Server speed variable with the current queue-

length

Building block for Hierarchical Modeling

slide-10
SLIDE 10

SIMUTOOLS09 March 5th, 2009

10

simplification of simulation experiments

automatic maximum relative error control [Pawlikowski 1990]

ratio half-width marginal CI / estimated mean

automatic removal of the initial bias (transient filtering) max n. of samples (long run analysis) and simulation time CI generation using spectral methods

slide-11
SLIDE 11

SIMUTOOLS09 March 5th, 2009

11

What-if Analysis

simulations control parameters

  • arrival rate (cl.)
  • customer numbers
  • service demands
  • pop. mix (2 class)
slide-12
SLIDE 12

SIMUTOOLS09 March 5th, 2009

12

the JMVA analytic solver

Solve open/closed/mixed BCMP queueing nets

Native support for what-if analyses Integrated with JSIMgraph (reuse models)

slide-13
SLIDE 13

SIMUTOOLS09 March 5th, 2009

13

jABA/ jMCH/ jWAT

jABA jMCH jWAT

slide-14
SLIDE 14

SIMUTOOLS09 March 5th, 2009

14

Case Study: maximization of throughput

  • Multi-tier system: Front Server, Storage Server, Database server
  • Workload: two web services WS1 (class 1) and WS2 (class 2)

Finite Capacity Region with constant population of requests

(N1,N2), N1+N2=N=100

13.95 86.86 Database Server service demand

DDB [ms]

55.18 69.15 Storage Server service demand

DSS [ms]

68.07 28.48 Front Server service demand

DFS [ms]

Web Service WS2 Web service WS1 Parameters

Admission Control algorithm → BEST mix of requests WS1+WS2

bottlenecks

slide-15
SLIDE 15

SIMUTOOLS09 March 5th, 2009

15

Case Study – JSIM Graphical interface

FC Region

slide-16
SLIDE 16

SIMUTOOLS09 March 5th, 2009

16

Case Study – JSIM simulation progress

slide-17
SLIDE 17

SIMUTOOLS09 March 5th, 2009

17

Case Study: JABA Asymptotic Analysis

com m on saturation sectors 0 2 0 8

slide-18
SLIDE 18

SIMUTOOLS09 March 5th, 2009

18

Case Study: JABA convex hull

potential bottlenecks

slide-19
SLIDE 19

SIMUTOOLS09 March 5th, 2009

19

Case Study: throughput vs mix of requests

I II III IV V 12 13 14 15 16 17 18 Experiment throughput [req/s]

(0.20, 0.80) (0.50, 0.50) (0.80, 0.20) (0.05, 0.95) (0.95, 0.05)

m axim um throughput - optim al m ix

slide-20
SLIDE 20

SIMUTOOLS09 March 5th, 2009

20

the project

http://jmt.sourceforge.net

> 11000 downloads since April 2006

conclusions