Introduction to Queueing Theory for Computer Scientists

Similar documents
Queueing Networks 32-1

Mean Value Analysis and Related Techniques

Analysis of Simulation Results

Workload Characterization Techniques

Verification and Validation of X-Sim: A Trace-Based Simulator

Testing Random- Number Generators

Analytic Performance Models for Bounded Queueing Systems

An Introduction to the Bootstrap

SIMULATION OF A SINGLE-SERVER QUEUEING SYSTEM

CSE 473s Introduction to Computer Networks

Chapter 3: Data Description Calculate Mean, Median, Mode, Range, Variation, Standard Deviation, Quartiles, standard scores; construct Boxplots.

Joe Wingbermuehle, (A paper written under the guidance of Prof. Raj Jain)

Learner Expectations UNIT 1: GRAPICAL AND NUMERIC REPRESENTATIONS OF DATA. Sept. Fathom Lab: Distributions and Best Methods of Display

Selection of Techniques and Metrics

Predicting Web Service Levels During VM Live Migrations

CSE 570S: Recent Advances in Networking

Cloud Monitoring as a Service. Built On Machine Learning

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

Mean Value Analysis and Related Techniques

Fathom Dynamic Data TM Version 2 Specifications

CS 425 / ECE 428 Distributed Systems Fall 2015

Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen

Simulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009

Queuing Networks Modeling Virtual Laboratory

CS 112: Computer System Modeling Fundamentals. Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8

One Factor Experiments

Probability Models.S4 Simulating Random Variables

CS533 Modeling and Performance Evaluation of Network and Computer Systems

CS533 Modeling and Performance Evaluation of Network and Computer Systems

Dynamic Virtual Machine Placement and Migration for Multi-access Edge Computing

Computer Systems Performance Analysis and Benchmarking (37-235)

Choosing the Right Procedure

Trace-Based Evaluation of Job Runtime and Queue Wait Time Predictions in Grids

COMPUTER NETWORK PERFORMANCE. Gaia Maselli Room: 319

EP2200 Queueing theory and teletraffic systems

Assignments Fill out this form to do the assignments or see your scores.

Fundamentals Of Queueing Theory Solutions Manual

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

3D Graphics Programming Mira Costa High School - Class Syllabus,

Advanced Systems Lab (Intro and Administration) G. Alonso Systems Group

Statistics Driven Workload Modeling for the Cloud

R Programming Basics - Useful Builtin Functions for Statistics

Algebra 2 Semester 2 Final Exam Study Outline Semester 2 Final Exam Study Tips and Information

Advanced Internet Technologies

EP2200 Queueing theory and teletraffic systems

Data Analysis and Solver Plugins for KSpread USER S MANUAL. Tomasz Maliszewski

Computations with Bounded Errors and Response Times on Very Large Data

StatCalc User Manual. Version 9 for Mac and Windows. Copyright 2018, AcaStat Software. All rights Reserved.

Choosing the Right Procedure

Tales of the Tail Hardware, OS, and Application-level Sources of Tail Latency

Routing in Switched Networks

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams

Wireless and Mobile Networks

Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation

Simulative Evaluation of Internet Protocol Functions

Excel Primer CH141 Fall, 2017

Data Network Protocol Analysis & Simulation

Search Engines Chapter 8 Evaluating Search Engines Felix Naumann

Simulation Input Data Modeling

10. Network dimensioning

Exercise: Graphing and Least Squares Fitting in Quattro Pro

MATH 021 UNIT 2 HOMEWORK ASSIGNMENTS

STA 570 Spring Lecture 5 Tuesday, Feb 1

Things you ll know (or know better to watch out for!) when you leave in December: 1. What you can and cannot infer from graphs.

CSC2100-Data Structures

Treadmill: Attributing the Source of Tail Latency through Precise Load Testing and Statistical Inference

STATISTICS FOR PSYCHOLOGISTS

EP2210 Scheduling. Lecture material:

Bootstrapping Method for 14 June 2016 R. Russell Rhinehart. Bootstrapping

>>> SOLUTIONS <<< a) What is a system? Give a short formal definition. (Hint: what you draw a box around is not a formal definition)

CSE 574S Wireless and Mobile Networking

1 Probability Review. CS 124 Section #8 Hashing, Skip Lists 3/20/17. Expectation (weighted average): the expectation of a random quantity X is:

Copyright 2015 by Sean Connolly

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

Quantitative - One Population

Efficient Lists Intersection by CPU- GPU Cooperative Computing

Design and Implementation of Measurement-Based Resource Allocation Schemes Within The Realtime Traffic Flow Measurement Architecture

WiMAX System Modeling Methodology

Transport Protocols. Raj Jain. Washington University in St. Louis

Sections 4.3 and 4.4

Regression on SAT Scores of 374 High Schools and K-means on Clustering Schools

Monte Carlo Ray Tracing. Computer Graphics CMU /15-662

Event-Driven Power Management

Excel 2010 with XLSTAT

Congestion Control in Communication Networks

Table Of Contents. Table Of Contents

Tackling Latency via Replication in Distributed Systems

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services

Energy Management Issue in Ad Hoc Networks

Statistics I 2011/2012 Notes about the third Computer Class: Simulation of samples and goodness of fit; Central Limit Theorem; Confidence intervals.

CSE 574S Wireless and Mobile Networking

Section 5.2: Next Event Simulation Examples

Statistics Worksheet 1 - Solutions

Programming model and implementation for processing and. Programs can be automatically parallelized and executed on a large cluster of machines

Getting to Know Your Data

City University of Hong Kong Course Syllabus. offered by College/School/Department of Electronic Engineering with effect from Semester B in 2017/2018

Energy Management Issue in Ad Hoc Networks

Resource Usage Monitoring for Web Systems Using Real-time Statistical Analysis of Log Data

C A S I O f x S UNIVERSITY OF SOUTHERN QUEENSLAND. The Learning Centre Learning and Teaching Support Unit

Performance Assurance in Virtualized Data Centers

Transcription:

Introduction to Queueing Theory for Computer Scientists Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings are available on-line at: and http://www.cse.wustl.edu/~jain/queue 1-1

Overview Goals of this Course Contents of the course Tentative Schedule Pre-requisites 1-2

Queueing vs. Queuing Queueing is one character longer than Queuing Oxford English dictionary (England) is much thicker than Webster English dictionary (American) because English add extra letters to words: Colour, Flavour, Humour, Neighbour It is not American vs. English. There are no queues in England. They form a line. Queueing is unique - the only word with 5 vowels together Queueing is original until 1950 s. MS word dictionary has only queuing. Corrects queueing to queuing. Now both are equally used. Amazon has 1176 books on queueing and 1260 books on queuing Google Scholar has 184000 papers on queueing and 212000 on queuing. Queueing is used by most respected computer scientists including Kleinrock, e.g., Queueing Systems Journal. 1-3

Goals of This Course Introductory course on Applications of Queueing Theory for Computer Scientists 1. Introduction to Queueing Theory 2. Analysis of A Single Queue 3. Queueing Networks 4. Operational Laws 5. Mean Value Analysis and Related Techniques 1-4

Queueing Models: What You will learn? What are various types of queues. What is meant by an M/M/m/B/K queue? How to obtain response time, queue lengths, and server utilizations? How to represent a system using a network of several queues? How to analyze simple queueing networks? How to obtain bounds on the system performance using queueing models? 1-5

Example Exercise 31.3: The average response time of a server is three seconds. During a one-minute observation interval, the idle time on the system was ten seconds. Using a queueing model for the system, determine the following: System utilization Average service time per query Number of queries completed during the observation interval Average number of jobs in the system Probability of number of jobs in the system being greater than 10 90-percentile response time 90-percentile waiting time 1-6

Examples of Recent Applications Server virtualized system with live VM migration Service delivery improvements for cloud service providers Trading power consumption against performance by reserving blocks of servers Optimal partitioning of a multi-core server processor Modeling and optimizing the delay-energy tradeoff in TDM systems with sleep mode Optimal inter-cell coordination for multiple user classes with elastic traffic 1-7

Prerequisite Basic Probability and Statistics: Mean, variance, standard deviation Density function, Distribution function Coefficient of variation Correlation coefficient Median, mode, quantile Normal distribution, Exponential distribution 1-8

Tentative Schedule 1 2 3 4 5 6 09/26/12 10/03/12 10/10/12 10/17/12 10/24/12 10/31/12 Introduction, Notation Single Queue Queueing Networks Operational Laws Operational Laws Mean Value Analysis 1-9

Homeworks Application of the concepts to a system of your choice. Due by Monday noon time by email. 1-10

Text Book R. Jain, Art of Computer Systems Performance Analysis, Wiley, 1991, ISBN:0471503363 (Winner of the 1992 Best Computer Systems Book Award from Computer Press Association ) 1-11

Other Related Topics Measurement techniques: Workload selection Workload characterization Probability and Statistics: Use of mean, median, modes, confidence Intervals Regression Experimental Design Maximum information from minimum number of experiments Simulation 1-12

Quiz 0: Prerequisites True or False? T F The mean of a uniform(0,1) variate is 1. The sum of two normal variates with means 4 and 3 has a mean of 7. The probability of a fair coin coming up head once and tail once in two throws is 1. The density function f(x) approaches 1 as x approaches. Given two variables, the variable with higher median also has a higher mean. The probability of a fair coin coming up heads twice in a row is 1/4. The difference of two normal variates with means 4 and 3 has a mean of 4/3. The cumulative distribution function F(x) approaches 1 as x approaches. High coefficient of variation implies a low variance and vice versa. Marks = Correct Answers - Incorrect Answers = /quiz0.html 1-13

Quiz 1: Post Quiz True or False? T F M/M/1/3/100 queue has 3 servers A single server queue with arrival rate of 1 jobs/sec and a service time of 0.5 seconds has server utilization of 0.5 The delay in an G/G/ system is equal to the job service time. In a product form queueing network, the probability of a state can be obtained by multiplying state probabilities of individual queues. During a 10 second observation period, 400 jobs were serviced by a processor which can process 200 jobs per second. The processor utilization is 50%. MVA can be used to compute response times for non-product form networks. Marks = Correct Answers - Incorrect Answers = /quiz1.html 1-15

Summary Queueing in computer systems is quite common Understanding queueing theory will help you make design decisions Simple models are often more useful than sophisticated complex expressions with invalid assumptions. 1-17