The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks

Similar documents
Shared-Memory Multiprocessor Systems Hierarchical Task Queue

Quantitative System Evaluation with Java Modelling Tools

Quantitative System Evaluation with Java Modeling Tools (Tutorial Paper)

RESEARCH OF JAVA MODELING TOOLS USING FOR MARKOV SIMULATIONS

Chapter 6 Queueing Networks Modelling Software (QNs) and Computing Language(s)

Performance Modeling of IoT Applications

Simulating storage system performance: a useful approach for SuperB?

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool

Index. ADEPT (tool for modelling proposed systerns),

Simulation Modeling and Analysis

fdrit- An Evaluation Tool for Transient Removal Methods in Discrete Event Stochastic Simulations

Versatile Models of Systems Using MAP Queueing Networks

Queuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012

Analysis of Simulation Results

Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation

Lecture 5: Performance Analysis I

Today s class. Scheduling. Informationsteknologi. Tuesday, October 9, 2007 Computer Systems/Operating Systems - Class 14 1

Distributed Simulation of Large Computer Systems

Scheduling Mar. 19, 2018

CPU Scheduling. Schedulers. CPSC 313: Intro to Computer Systems. Intro to Scheduling. Schedulers in the OS

Uniprocessor Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms. Three level scheduling

Fundamentals of Queueing Models

LECTURE 3:CPU SCHEDULING

Introduction to Queuing Systems

Announcements/Reminders

Router s Queue Management

Multimedia Systems 2011/2012

Introduction: Two motivating examples for the analytical approach

DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing

Simulation. Outline. Common Mistakes in Simulation (3 of 4) Common Mistakes in Simulation (2 of 4) Performance Modeling Lecture #8

Blocking Analysis of FIFO, Unordered, and Priority-Ordered Spin Locks

Week 7: Traffic Models and QoS

Processes and Threads. Processes: Review

IX: A Protected Dataplane Operating System for High Throughput and Low Latency

Building and evaluating network simulation systems

Course Syllabus. Operating Systems

EP2200 Queueing theory and teletraffic systems

Performance evaluation and benchmarking of DBMSs. INF5100 Autumn 2009 Jarle Søberg

TELCOM 2130 Queueing Theory. David Tipper Associate Professor Graduate Telecommunications and Networking Program. University of Pittsburgh

Resource Allocation Strategies for Multiple Job Classes

UNIT 4: QUEUEING MODELS

JMT Based Performance Evaluation of Network for Dynamic Service Time Distribution

Chapter 14 Performance and Processor Design

Mohammad Hossein Manshaei 1393

QUESTION BANK UNIT I

Cycle Sharing Systems

Global Scheduling in Multiprocessor Real-Time Systems

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

Simulation with Arena

Section 5.2: Next Event Simulation Examples

SMD149 - Operating Systems

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science

Announcements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM.

Teletraffic theory I: Queuing theory

Introduction to the course

On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering

Basic Switch Organization

8: Scheduling. Scheduling. Mark Handley

Scheduling of processes

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Performance measurement. SMD149 - Operating Systems - Performance and processor design. Introduction. Important trends affecting performance issues

Queueing Networks analysis with GNU Octave. Moreno Marzolla Università di Bologna

Start of Lecture: February 10, Chapter 6: Scheduling

Improving VoD System Efficiency with Multicast and Caching

Performance Analysis of WLANs Under Sporadic Traffic

A Queueing Network Model for Performance Prediction of Apache Cassandra

VALIDATING AN ANALYTICAL APPROXIMATION THROUGH DISCRETE SIMULATION

Exam Guide COMPSCI 386

Introduction to Multiprocessors (Part I) Prof. Cristina Silvano Politecnico di Milano

Characterizing Energy per Job in Cloud Applications

Network Traffic Characterisation

CS370 Operating Systems

Computer Networking. Queue Management and Quality of Service (QOS)

Calculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation

A Capacity Planning Methodology for Distributed E-Commerce Applications

RED behavior with different packet sizes

Bottlenecks Identification in Multiclass Queueing Networks using Convex Polytopes

CS418 Operating Systems

Uniprocessor Scheduling. Aim of Scheduling

Uniprocessor Scheduling. Aim of Scheduling. Types of Scheduling. Long-Term Scheduling. Chapter 9. Response time Throughput Processor efficiency

Scheduling. Today. Next Time Process interaction & communication

Performance Evaluation of Distributed Software Systems

CSCE Operating Systems Scheduling. Qiang Zeng, Ph.D. Fall 2018

Reference Model and Scheduling Policies for Real-Time Systems

CHAPTER 2: PROCESS MANAGEMENT

Evaluation of Temporal and Performance Aspects

Application of Importance Sampling in Simulation of Buffer Policies in ATM networks

OPTIMIZING PRODUCTION WORK FLOW USING OPEMCSS. John R. Clymer

A COMPUTER-AIDED SIMULATION ANALYSIS TOOL FOR SIMAN MODELS AUTOMATICALLY GENERATED FROM PETRI NETS

When Average is Not Average: Large Response Time Fluctuations in n-tier Applications. Qingyang Wang, Yasuhiko Kanemasa, Calton Pu, Motoyuki Kawaba

Chapter 9 Uniprocessor Scheduling

Simulation Models for Manufacturing Systems

General Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

EP2200 Queueing theory and teletraffic systems

CS370 Operating Systems

Scheduling on clusters and grids

Advanced Internet Technologies

Titolo presentazione. Scheduling. sottotitolo A.Y Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella

TDDD82 Secure Mobile Systems Lecture 6: Quality of Service

Transcription:

Politecnico di Milano - DEI Milan, Italy The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks Marco Bertoli, Giuliano Casale, Giuseppe Serazzi Speaker: Giuliano Casale March 26th, 2007 40 th ANSS 2007 Symp. Norfolk, VA, US

Introduction The JMT Simulator Outline Generalities Statistical Analysis of Simulation Results Non-Product-Form Features Case Study 2

Capacity Planning & Performance Clients e.g., Storage e.g., DB Web/Application Servers What will be the worst-case quality of service? What-if I upgrade my hardware? What-if I consolidate servers using virtualization? 3

Capacity Planning Example Select Best Design/Configuration (Routing, Num of Servers/Reqs) Reqs/sec e.g., Best Admission Control Policy Throughput HTTP Throughput Video-Streaming MAX Simultaneous Connections 4

Restrictive Assumptions of PF Theory Models are analytically tractable if: State independent service Non-idling service policies No Blocking No Finite buffers No Priorities FIFO = Exponential service Static Routing... Internet Server Closed-Loop Workloads Strong restrictions for real applications PF networks still valuable bounds/approximations Server Server 5

Non-Product Form (NPF) Models NPF models hard to approximate Multiple NPF features make the model impossible No theory for multiclass NPF models Simulation typically required/preferred (easier ) Java Modelling Tools project (2006) Open source set of analytical and simulative tools http://jmt.sourceforge.net Strong diffusion for both research and teaching Maximum portability (Java) 6

JSIM: NPF models simulator Core simulation module of the JMT suite Comes with two graphical interfaces: JSIMgraph JSIMwiz 7

JSIM Architecture and Design Choices Statistical Analysis Non-Product-Form Modeling Features 8

JMT & JSIM: Architecture Model-View-Controller -like pattern Better reuse and isolation of components Views JMT Tools JSIMwiz JSIMgraph XML XSLT XSLT XML Visualize Status Model jsim Engine ( Controller ) 9

DES Engine & Simulation Entities Discrete Event Calendar for queue activity Simulation entities are compound objects Input Section Service Section Output Section Examples Exogenous arrivals Single Server Queue 10

Simulation Coordination Strong messaging system Complete separation between sections External contributors need only to implement the correct messaging behavior 11

Control of Simulation Experiments Simplification of Experiment control Maximum Relative Error [Pawlikowski, 1990] Ratio Half-width marginal C.I. / Estimated Mean Maximum Number of samples (Long run analysis) Maximum Simulation Time 12

What-if Analysis 13

JSIM Architecture and Design Choices Statistical Analysis of Simulation Results Non-Product-Form Modeling Features 14

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 15

Transient Filtering Superposition of several rules to improve effectiveness 16

R5 Heuristic Transient Filtering (II) Implemented according to [Pawlikowski, 1990] Initial transient = samples cross mean k times k is a (critical) user-specified parameter k=25 for M/M/1 (Garfarian et al., 1978) Hundreds of thousands samples discarded k=7 for M/M/1/15 (Wilson & Prisker, 1978) On many networks early detection during transient ramp JMT sets this parameter to a conservative k=19 17

Transient Filtering (III) MSER [White, 1996] Best truncation point in a data sequence Detects the point that minimizes the width of the marginal confidence interval about the est. mean MSER-5 [Spratt, 1998] Batches composed by 5 samples We implemented an online version of the algorithm Cyclically run on 5000 batches until detection Increasing the number of batches has limited effect 18

JSIM Architecture and Design Choices Statistical Analysis of Simulation Results Non-Product-Form Modeling Features 19

JSIM NPF Models Main NPF modeling features General Arrival and Service Processes Fork-Join Centers Finite Capacity Models Priority Classes Advanced state-dependent routing, e.g.: Route to least utilized queue Route to shortest queue 20

Arrival and Service Process Exponential insufficient for many models Pareto, Hyperexponential, Erlang, Gamma, Custom distribution (external text file, future JWAT) Random number generation Mersenne Twister Load-dependent service process Server speed variable with the current queue-length Building block for Hierarchical Modeling 21

Hierarchical Modeling Compact representation of large models Image taken from: Lazowska et al. Quantitative System Performance. Prentice-Hall, 1984. 22

Fork-Join Systems Popular in storage and multiprocessor models Jobs are forked at fork node into P tasks Synchronization at the join node before leaving JSIM: special ad-hoc Fork and Join components 23

Finite Capacity Regions Models of admission control in networks Describe well application and memory constraints JSIM allows to tag a group of queues as a region Non-admitted jobs can be either put in a FCFS waiting buffer or dropped 24

Case Study Multiprocessor Web server Workloads: orders (class 1), backend service (class 2) Constant population of requests (N1,N,N2), N1+NN +N2= FC Region 2=N Finite capacity constraints Limits shared by all classes, or class-dedicated 25

Asymptotic Analisys in PF Networks How does the system evolves with the mix? PF=Multiple bottlenecks, still unobserved in NPF Utilization vs Population Mix for a 5 queues model Multiple bottlenecks! Service Times 26

Shared constraints (no multiple bottlenecks) 27

Shared constraints (no multiple bottlenecks) 28

Dedicated Class 1 (no multiple bottlenecks) 29

Dedicated Class 2 (multiple bottlenecks!) 30

Observations Theoretical interest to better understand multiclass models Class 1 has bottleneck outside the FC region Class 2 has bottleneck inside the FC region FC region creates a closed PF sub-model Behavior of PF models may apply inside the region We expect to observe the effect also in real systems 31

Conclusion JSIM: advanced queueing network simulation Free, open source, GNU GPL project http://jmt.sourceforge.net External contributors are welcome Current version 0.7, new releases to come 32