Queuing Networks. - Outline of queuing networks. - Mean Value Analisys (MVA) for open and closed queuing networks
|
|
- Leo Heath
- 5 years ago
- Views:
Transcription
1 Queuing Networks - Outline of queuing networks - Mean Value Analisys (MVA) for open and closed queuing networks 1
2 incoming requests Open queuing networks DISK CPU CD outgoing requests Closed queuing networks (finite number of users) DISK M clients CPU CD 2
3 Kind of resources in a queuing network Load independent S(n) R(n) n Load dependent S(n) R(n) n Delay S(n) R(n) n 3
4 Definitions K: number of queues X 0 : network average throughput. If open network in a stationary condition X 0 = V i : average number of visits a generic request makes to i server from its generation to its service time (request goes out from the system if open network) S i : average request service time at the server i W i : average request waiting time in the queue i R i : average request response time in the queue i R i = S i + W i 4
5 Definitions X i : throughput for the i-th queue X i = X 0 V i R i: average request residence time in the queue i from its creation to its service completion time (request goes out from the system if open network) R i = V i R i D i : request service demand to a server in a queue i from its creation to its service completion time (request goes out from the system if open network) D i = V i S i 5
6 Q i : total time a request spends waiting in the queue i from its creation to its service time (request goes out from the system if open network) Q i = V i W i R i = V i R i =V i (W i + S i ) = W i V i + S i V i = Q i + D i R 0 : total average request response time ((from the whole system) R 0 = k i=1 R i n i : average number of requests waiting or in service at the queue i N: average number of requests in the system N = k i=1 n i 6
7 Open queuing networks incoming requests CPU DISK TAPE outgoing requests 7
8 Open networks (Single Class) Equations: Arrival theorem (for open networks): the average number of requests in a queue i that an incoming request find in the same queue (n a i), is equal to the average number of requests in the queue i (n i ). R i (n) = S i + W i (n) = S i + n i S i Using Little s Law (n i = X i R i ) and U i = X i S i : R i = S i _ (1-U i ) given that R i = S i (1 + n i ) = S i + S i X i R i = S i + U i R i R i (1- U i ) = S i 8
9 Open networks (Single Class) Equations: Then: R i = V i R i = D i _ (1-U i ) besides: n i = U i _ (1-U i ) because n i = X i R i R i = S i / (1- U i ) U i = X i S i 9
10 Calculation of the greatest : Given: Open networks (Single Class) In an open network the average frequency of users incoming into the network is fixed. For too much big the network will become unstable, we are then interested in the greatest value of that we can apply to the network. U i = X i S i = V i S i then: = U i / D i because D i = V i S i U i = 1 is the greatest utilization factor of a queue (i.e.= i), then we can calculate the greatest that doesn t make unstable the system as: 1 _ max k i=1 D i 10
11 DB Server (example 9.1) CPU DISK1 DISK2 = requests per hour = 3 requests per sec = X 0 D CPU = 0,2 sec V DISK1 = 5 V DISK2 = 3 S DISK1 = S DISK2 = 15 msec Service demand at CPU D DISK1 = V DISK1 * S DISK1 = 5 * 15 msec = 75 msec Service demand at disk 1 D DISK2 = V DISK2 * S DISK2 = 3 * 15 msec = 45 msec Service demand at disk 2 11
12 DB Server (example 1). Service Demand Law CPU DISK1 DISK2 U CPU = D CPU * X 0 = 0,2 sec/req * 3 req/sec = 0,6 CPU utilization U D1 = D DISK1 * X 0 = = 0,225 Disk1 utilization U D2 = = 0,135 Disk2 utilization Residence time R CPU = D CPU / (1- U CPU ) = 0,5 sec R D1 = D DISK1 / (1- U DISK1 ) = 0,097 sec R D2 = D DISK2 / (1- U DISK2 ) = 0,052 sec 12
13 Total response time R 0 = R CPU + R D1 + R D2 = 0,649 sec Average number of requests at each queue n CPU = U CPU / (1- U CPU ) = 0,6 / (1-0,6) = 1,5 n DISK1 = = 0,29 n DISK2 = = 0,16 Total number of requests at the server N = n CPU + n DISK2 + n DISK2 = 1,95 requests RMaximum arrival rate = 1 _ = 1 _ = 5 req /sec max k i=1 D i max (0,2; 0,075; 0,045) 13
14 Closed queue network (finite number of users) DISK M clients CPU TAPE 14
15 Closed networks (Mean Value Analysis) Allows calculating the performance indeces (average response time, throughput, average queue lenght, etc ) for a closed network Iterative method based on the consideration that a queuing network results can be calculated from the same network results with a population reduced by one unit. Useful also for hybrid queuing networks Definitions. X 0 : average queuing network throughput.. V i : average number of visits for a request at a queue i.. S i : average service time for a request on the server i.. R i : average response time for a request at the queue i (service+waiting time) 15
16 Closed networks (Mean Value Analysis) Definitions. R i: total average stay time for a request at the queue i considering all its visits at the queue. Equal to V i R i. D i : total average service time for a request at the queue i considering all its visits at the queue. Equal to V i S i. R 0 : average response time of the queuing network. Equal to the sum of the R i. n ia : average number of the requests found by a request incoming in the queue. Forced Flow Law Then we have: X i = X 0 V i 16
17 Mean Value Analysis (Single class) Equations: R i (n) = S i + W i (n) = S i + n ia (n) S i = S i (1+ n ia (n) ) Arrival Theorem: the average number of requests (n ia ) in a queue i that an incoming request finds in the same queue is equal to the average number of requests in the queue i when n-1 requests are in the queuing network (n i (n-1) that is n minus the incoming request that wants the service on the i-th queue) in other words: n ia (n) = n i (n-1) (i.e n i is function of n-1) then: R i = S i (1+n i (n-1)) and multiplying both members for V i R i = D i (1+n i (n-1)) 17
18 Mean Value Analysis (Single class) Equations: Applying Little s Law to the whole queuing network system (n=x 0 R 0 ), we have: X 0 = n / R 0 (n) = n / K r=1 R i(n) Applying Little s Law and Forced Flow Law: n i (n) = X i (n) R i (n) = X 0 (n) V i R i (n) = X 0 (n) R i(n) 18
19 Mean Value Analysis (Single class) Three equations: Residence Time equation R i (n)= D i [1+n i (n-1)] Throughput equation X 0 (n)= n / K r=1 R i(n) Queue lenght equation n i (n) = X 0 (n) R i(n) 19
20 Iterative procedure: Mean Value Analysis (Single class) 1. We know that n i (n) = 0 for n=0: if no users is in the queuing network, then no users (requests) will be in every single queue. 2. Given n i (0) it s possible to evaluate all R i(1) 3. Given all R i(1) it s possible to evaluate all n i (1) and X 0 (1) 4. Given all n i (1) it s possible to evaluate all R i(2) 5. The procedure continues until all n i (n), R i(n) and X 0 (n) are found, where n is the total number of users (requests) inside the network. 20
21 DB Server (example 9.3) Requests from 50 clients Every request needs 5 record read from (visit to) a disk Average read time for a record (visit) = 9 msec Every request to DB needs 15 msec CPU D CPU = S CPU = 15 msec D DISK = S DISK * V DISK = 9 * 5 = 45 msec CPU service demand Disk service demand 21
22 Using MVA Equations DB Server (example 2) n = 0; Number of concurrent requests R CPU = 0; Residence time for CPU R DISK = 0; Residence time for disk R 0 = 0; Average response time X 0 = 0; Throughput n CPU = 0; Queue lenght at CPU n DISK = 0 Queue lenght at disk n = 1; R CPU = D CPU (1+ n CPU (0)) = D CPU = 15 msec; R DISK = D DISK (1+ n DISK (0)) = D DISK = 45 msec; R 0 = R CPU + R DISK = 60 msec; X 0 = n/ R 0 = 0,0167 tx/msec n CPU = X 0 * R CPU = 0,250 n DISK = X 0 * R DISK = 0,750 22
23 DB Server (example 2) n = 1; R CPU = D CPU (1+ n CPU (0)) = D CPU = 15 msec; R DISK = D DISK (1+ n DISK (0)) = D DISK = 45 msec; R 0 = R CPU + R DISK = 60 msec; X 0 = 1 / R 0 = 0,0167 tx/msec n CPU = X 0 * R CPU = 0,250 n DISK = 0,750 n = 2; R CPU = D CPU (1 + n CPU (1)) = 15 * 1,25 = 18,75 msec; R DISK = D DISK (1 + n DISK (1)) = 45 * 1,750 = 78,75 msec; R 0 = R CPU + R DISK = 97,5 msec; X 0 = 2 / R 0 = 0,0205 tx/msec n CPU = X 0 * R CPU = 0,38 n DISK = X 0 * R DISK = 1,62 23
24 The related Markov process 50/Z 49/Z 1/Z X 0 (1) X 0 (2) X 0 (50) 24
25 Closed networks (Single Class) - Bounds Bottleneck identification (1/3) Usually the queuing network throughput will reach saturation if requests increase inside the system; we are then interested in finding the component in the system that causes saturation. in open networks: 1 _ max k i=1 D i and replacing with X 0 (n): X 0 (n) 1 _ max k i=1 D i 25
26 Closed networks (Single Class) - Bounds Bottleneck identification (2/3) from throughput equation of MVA, remembering that R i (n) = D i [1 + n i (n-1)] R i D i for every queue i, then we have (from Little s formula): X 0 (n) = n n _ K r=1 R i K r=1 D i 26
27 Closed networks (Single Class) - Bounds Bottleneck identification (3/3) Combining the preceding two equations we obtain: X 0 (n) min n _, 1 _ K r=1 D i max k i=1 D i For little n the throughput will increase at the most in a linear way with n, then becomes flat around the value 1/ max k i=1 D i X 0 n 27
28 Average response time (1/2) Closed networks (Single Class) - Bounds When throughput reaches its greatest value (that is for n big) the average response time is equivalent to: R 0 (n) n _ max throughput Then for n big the response time increases in a linear way with n: R 0 (n) n max k i=1 D i On the contrary, for small values of n (n near to 1) the average response time will be: R 0 (n) = K r=1 D i considering that all waiting times are null. 28
29 Closed networks (Single Class) - Bounds Average response time (2/2) We can establish a lower bound on average response time equal to: R 0 (n) max K i=1 D i, n max k i=1 D i 29
30 DB Server (Example 9.4) New scenarios with regard to previous example: a. index variation in DB (# of disk access equal to 2,5 (before was 5)) b. 60% faster Disk (average service time = 5,63 msec) c. faster CPU (service demand = 7,5 msec) Scenario Service demand Service demand D i 1/ maxd i Bottleneck D CPU D DISK a 15 2,5 * 9 = 22,5 37,5 0,044 disk b 15 5*5,63 = 28,15 43,15 0,036 disk c 15/2 = 7, ,5 0,022 disk a+b 15 2,5*5,63 = 14,08 29,08 0,067 CPU a+c 15/2 = 7,5 2,5 * 9 = 22,5 30,0 0,044 disk 30
COMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
More informationCSM: Operational Analysis
CSM: Operational Analysis 2016-17 Computer Science Tripos Part II Computer Systems Modelling: Operational Analysis by Ian Leslie Richard Gibbens, Ian Leslie Operational Analysis Based on the idea of observation
More informationOperational Laws Raj Jain
Operational Laws 33-1 Overview What is an Operational Law? 1. Utilization Law 2. Forced Flow Law 3. Little s Law 4. General Response Time Law 5. Interactive Response Time Law 6. Bottleneck Analysis 33-2
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationConvolution Algorithm
Convolution Algorithm Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-08/
More informationScheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling
Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out
More informationOperational Laws 33-1
Operational Laws 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
More informationAnálise e Modelagem de Desempenho de Sistemas de Computação
Análise e Modelagem de Desempenho de Sistemas de Computação ``Performance Models Virgilio A. F. Almeida 1 o Semestre de 2009 Introdução: Semana #4 Computer Science Department Federal University of Minas
More informationScheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling
Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the
More informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
More informationCOMP9334 Capacity Planning for Computer Systems and Networks
COMP9334 Capacity Planning for Computer Systems and Networks Week 2: Operational Analysis and Workload Characterisation COMP9334 1 Last lecture Modelling of computer systems using Queueing Networks Open
More informationOperational Laws. Operational Laws. Overview. Operational Quantities
Operational Laws Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu Mini-Course offered at UC erkeley, Sept-Oct 2012 These slides and audio/video recordings are available
More informationde Computação ``E business: banking services Virgilio A. F. Almeida
Análise e Modelagem de Desempenho de Sistemas de Computação ``E business: banking services irgilio A. F. Almeida 1st semester 2009 Week #9 Computer Science Department Federal University of Minas Gerais
More informationCase Study IV: An E-Business Service
Case Study I: n E-usiness Service Pro. Daniel. Menascé Department o Computer Science George Mason University www.cs.gmu.edu/aculty/menasce.html 1 Copyright Notice Most o the igures in this set o slides
More informationHomework 1 - SOLUTION
Homework - SOLUTION Problem M/M/ Queue ) Use the fact above to express π k, k > 0, as a function of π 0. π k = ( ) k λ π 0 µ 2) Using λ < µ and the fact that all π k s sum to, compute π 0 (as a function
More informationProf. Daniel A. Menascé Department of Computer Science George Mason University
Pro. Daniel. Menascé Deartment o Comuter Science George Mason University www.cs.gmu.edu/aculty/menasce.html 2004 D.. Menascé. ll Rights Reserved. 1 Most o the igures in this set o slides come rom the book
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationA POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS
A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS J. Anselmi 1, G. Casale 2, P. Cremonesi 1 1 Politecnico di Milano, Via Ponzio 34/5, I-20133 Milan, Italy 2 Neptuny
More informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationOne billion+ terminals in voice network alone
Traffic Engineering Traffic Engineering One billion+ terminals in voice networ alone Plus data, video, fax, finance, etc. Imagine all users want service simultaneously its not even nearly possible (despite
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationParijat Dube Jian Tan Li Zhang. IBM T. J. Watson Research Center 19, Skyline Drive Hawthorne NY 10532, USA
Proceedings of the 2011 Winter Simulation Conference S. ain, R. R. Creasey,. Himmelspach,. P. White, and M. u, eds. IDENTIICATION AND APPROXIMATIONS OR SYSTEMS WITH MULTI-STAGE WORLOWS Parijat Dube ian
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
More informationQueueing Networks G. Rubino INRIA / IRISA, Rennes, France
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationCPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationModelling data networks stochastic processes and Markov chains
Modelling data networks stochastic processes and Markov chains a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) December 2011 Available online
More informationMarkov decision processes with threshold-based piecewise-linear optimal policies
1/31 Markov decision processes with threshold-based piecewise-linear optimal policies T. Erseghe, A. Zanella, C. Codemo Dept. of Information Engineering, University of Padova, Italy Padova, June 2, 213
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationNote special lecture series by Emmanuel Candes on compressed sensing Monday and Tuesday 4-5 PM (room information on rpinfo)
Formulation of Finite State Markov Chains Friday, September 23, 2011 2:04 PM Note special lecture series by Emmanuel Candes on compressed sensing Monday and Tuesday 4-5 PM (room information on rpinfo)
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationA Hysteresis-Based Energy-Saving Mechanism for Data Centers Christian Schwartz, Rastin Pries, Phuoc Tran-Gia www3.informatik.uni-wuerzburg.
Institute of Computer Science Chair of Communication Networks Prof. Dr.-Ing. P. Tran-Gia A Hysteresis-Based Energy-Saving Mechanism for Data Centers Christian Schwartz, Rastin Pries, Phuoc Tran-Gia www3.informatik.uni-wuerzburg.de
More informationMAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.
MAT 4371 - SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions. Question 1: Consider the following generator for a continuous time Markov chain. 4 1 3 Q = 2 5 3 5 2 7 (a) Give
More informationCHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS
CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS 1. Overview In this chapter we explore the models on which the HCM capacity analysis method for signalized intersections are based. While the method has
More informationHITTING TIME IN AN ERLANG LOSS SYSTEM
Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations
More informationCPU Scheduling Exercises
CPU Scheduling Exercises NOTE: All time in these exercises are in msec. Processes P 1, P 2, P 3 arrive at the same time, but enter the job queue in the order presented in the table. Time quantum = 3 msec
More informationLittle s Law assumptions: But I still wanna use it! The Goldilocks solution to sizing the system for non-steady-state dynamics
Little s Law assumptions: But I still wanna use it! The Goldilocks solution to sizing the system for non-steady-state dynamics Alex Gilgur Abstract Little s Law is well known: number of concurrent users
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationHow to deal with uncertainties and dynamicity?
How to deal with uncertainties and dynamicity? http://graal.ens-lyon.fr/ lmarchal/scheduling/ 19 novembre 2012 1/ 37 Outline 1 Sensitivity and Robustness 2 Analyzing the sensitivity : the case of Backfilling
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationModelling data networks stochastic processes and Markov chains
Modelling data networks stochastic processes and Markov chains a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) November 2016 Available online
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationBounded Delay for Weighted Round Robin with Burst Crediting
Bounded Delay for Weighted Round Robin with Burst Crediting Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-0230-08 Telecommunications and Information Sciences Laboratory Department of
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More information1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
More informationDynamic Service Placement in Geographically Distributed Clouds
Dynamic Service Placement in Geographically Distributed Clouds Qi Zhang 1 Quanyan Zhu 2 M. Faten Zhani 1 Raouf Boutaba 1 1 School of Computer Science University of Waterloo 2 Department of Electrical and
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationT. Liggett Mathematics 171 Final Exam June 8, 2011
T. Liggett Mathematics 171 Final Exam June 8, 2011 1. The continuous time renewal chain X t has state space S = {0, 1, 2,...} and transition rates (i.e., Q matrix) given by q(n, n 1) = δ n and q(0, n)
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationSeason Finale: Which one is better?
CS4310.01 Introduction to Operating System Spring 2016 Dr. Zhizhang Shen Season Finale: Which one is better? 1 Background In this lab, we will study, and compare, two processor scheduling policies via
More informationSandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue
Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As
More informationA Quantitative View: Delay, Throughput, Loss
A Quantitative View: Delay, Throughput, Loss Antonio Carzaniga Faculty of Informatics University of Lugano September 27, 2017 Outline Quantitative analysis of data transfer concepts for network applications
More informationOperations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:
Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam 1 2 3 4 5 6 7 8 9 10 7 questions. 1. [5+5] Let X and Y be independent exponential random variables where X has
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
More informationIrreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1
Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate
More informationHomework 4 due on Thursday, December 15 at 5 PM (hard deadline).
Large-Time Behavior for Continuous-Time Markov Chains Friday, December 02, 2011 10:58 AM Homework 4 due on Thursday, December 15 at 5 PM (hard deadline). How are formulas for large-time behavior of discrete-time
More informationTDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.
TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor
More informationModelling Complex Queuing Situations with Markov Processes
Modelling Complex Queuing Situations with Markov Processes Jason Randal Thorne, School of IT, Charles Sturt Uni, NSW 2795, Australia Abstract This article comments upon some new developments in the field
More informationComputer Networks Fairness
Computer Networks Fairness Saad Mneimneh Computer Science Hunter College of CUNY New York Life is not fair, but we can at least theorize 1 Introduction So far, we analyzed a number of systems in terms
More informationExperiments with Measuring Time in PRISM 4.0
Experiments with Measuring Time in PRISM 4.0 Wolfgang Schreiner Research Institute for Symbolic Computation (RISC) Johannes Kepler University, Linz, Austria Wolfgang.Schreiner@risc.jku.at March 1, 2013
More informationStability of the two queue system
Stability of the two queue system Iain M. MacPhee and Lisa J. Müller University of Durham Department of Mathematical Science Durham, DH1 3LE, UK (e-mail: i.m.macphee@durham.ac.uk, l.j.muller@durham.ac.uk)
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationCPU scheduling. CPU Scheduling
EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationChapter 3: Markov Processes First hitting times
Chapter 3: Markov Processes First hitting times L. Breuer University of Kent, UK November 3, 2010 Example: M/M/c/c queue Arrivals: Poisson process with rate λ > 0 Example: M/M/c/c queue Arrivals: Poisson
More informationMatthew Zyskowski 1 Quanyan Zhu 2
Matthew Zyskowski 1 Quanyan Zhu 2 1 Decision Science, Credit Risk Office Barclaycard US 2 Department of Electrical Engineering Princeton University Outline Outline I Modern control theory with game-theoretic
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationReal-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm
Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should
More informationQueuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia
Queuing Theory and Stochastic Service Systems Li Xia Syllabus Instructor Li Xia 夏俐, FIT 3 618, 62793029, xial@tsinghua.edu.cn Text book D. Gross, J.F. Shortle, J.M. Thompson, and C.M. Harris, Fundamentals
More informationCapacity management for packet-switched networks with heterogeneous sources. Linda de Jonge. Master Thesis July 29, 2009.
Capacity management for packet-switched networks with heterogeneous sources Linda de Jonge Master Thesis July 29, 2009 Supervisors Dr. Frank Roijers Prof. dr. ir. Sem Borst Dr. Andreas Löpker Industrial
More informationCS 798: Homework Assignment 3 (Queueing Theory)
1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of
More informationScheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University
6 Scheduling Uwe R. Zimmer & Alistair Rendell The Australian National University References for this chapter [Bacon98] J. Bacon Concurrent Systems 1998 (2nd Edition) Addison Wesley Longman Ltd, ISBN 0-201-17767-6
More informationWays to study a system System
Simulation What is simulation? Simple synonym: imitation We are interested in studying a system Instead of experimenting with the system itself we experiment with a model of the system Ways to study a
More informationBetter Simulation Metamodeling: The Why, What and How of Stochastic Kriging
Better Simulation Metamodeling: The Why, What and How of Stochastic Kriging Jeremy Staum Collaborators: Bruce Ankenman, Barry Nelson Evren Baysal, Ming Liu, Wei Xie supported by the NSF under Grant No.
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationEP2200 Course Project 2017 Project II - Mobile Computation Offloading
EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of
More informationProportional Share Resource Allocation Outline. Proportional Share Resource Allocation Concept
Proportional Share Resource Allocation Outline Fluid-flow resource allocation models» Packet scheduling in a network Proportional share resource allocation models» CPU scheduling in an operating system
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationCHAPTER 5 - PROCESS SCHEDULING
CHAPTER 5 - PROCESS SCHEDULING OBJECTIVES To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria
More informationLast class: Today: Threads. CPU Scheduling
1 Last class: Threads Today: CPU Scheduling 2 Resource Allocation In a multiprogramming system, we need to share resources among the running processes What are the types of OS resources? Question: Which
More information