Queueing Systems They’re EVERYWHERE!. Basic Concept Service Request... Done Numerous requests made for service Lines back up waiting for service Waiting.

Slides:



Advertisements
Similar presentations
ArrivalsServiceWaiting line Exit Processing order System Queuing Systems: basic elements.
Advertisements

Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Copyright © 2005 Department of Computer Science CPSC 641 Winter PERFORMANCE EVALUATION Often in Computer Science you need to: – demonstrate that.
CS 408 Computer Networks Congestion Control (from Chapter 05)
Chapter 11 Data Link Control
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 16 Scheduling II.
Lecture 3 Concepts of Discrete-Event Simulation. 2 Discrete Event Model  In the discrete approach to system simulation, state changes in the physical.
Event-drive SimulationCS-2303, C-Term Project #3 – Event-driven Simulation CS-2303 System Programming Concepts (Slides include materials from The.
Local Area Networks LAN. Why LANs? Provide a means of DIRECT connection to other machines Manage access Provide reasonable performance Hopefully allow.
Understanding Networked Applications: A First Course Chapter 17 by David G. Messerschmitt.
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
1 CSSE 477 – A bit more on Performance Steve Chenoweth Friday, 9/9/11 Week 1, Day 2 Right – Googling for “Performance” gets you everything from Lady Gaga.
Scheduling in Batch Systems
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
Queueing Systems They’re EVERYWHERE!. Basic Concept Service Request... Done Numerous requests made for service Lines back up waiting for service Waiting.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Performance Evaluation
CS 104 Introduction to Computer Science and Graphics Problems Operating Systems (2) Process Management 10/03/2008 Yang Song (Prepared by Yang Song and.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
1 PERFORMANCE EVALUATION H Often in Computer Science you need to: – demonstrate that a new concept, technique, or algorithm is feasible –demonstrate that.
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Modified from Silberschatz, Galvin and Gagne ©2009 Lecture 8 Chapter 5: CPU Scheduling.
Computer System Lifecycle Chapter 1. Introduction Computer System users, administrators, and designers are all interested in performance evaluation. Whether.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
Queueing Theory [Bose] “The basic phenomenon of queueing arises whenever a shared facility needs to be accessed for service by a large number of jobs or.
Queuing models Basic definitions, assumptions, and identities Operational laws Little’s law Queuing networks and Jackson’s theorem The importance of think.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
1 Network Properties (Ownership, Service Paradigm, Measures of Performance)
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 15 Scheduling Read Ch.
Network Performance. Performance (1) What would be the characteristics of the ideal network? –It would be completely transparent in every conceivable.
Processes CSCI 4534 Chapter 4. Introduction Early computer systems allowed one program to be executed at a time –The program had complete control of the.
1 Components performance modelling - Outline of queue networks - Mean Value Analisys (MVA) for open and close queue networks.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
Chapter 8 System Management Semester 2. Objectives  Evaluating an operating system  Cooperation among components  The role of memory, processor,
QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Lecture 4 Page 1 CS 111 Summer 2013 Scheduling CS 111 Operating Systems Peter Reiher.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter
1 Lecture 5: CPU Scheduling Operating System Fall 2006.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Operating System Components) These components reflect the services made available by the O.S. Process Management Memory Management I/O Device Management.
Virtual Memory Networks and Communication Department.
Scheduling (Priority Based)
Introduction to Materials Management
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Congestion Control in Data Networks and Internets
Chapter5: CPU Scheduling
Operating System Concepts
Chapter 6: CPU Scheduling
Congestion Control (from Chapter 05)
Chapter 5: CPU Scheduling
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Congestion Control (from Chapter 05)
Chapter 6: CPU Scheduling
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Congestion Control (from Chapter 05)
Module 5: CPU Scheduling
Presentation transcript:

Queueing Systems They’re EVERYWHERE!

Basic Concept Service Request... Done Numerous requests made for service Lines back up waiting for service Waiting times increase non-linearly

Consider a perfect system Customers arrive in optimal fashion CustomerArrives at Service Required Never any waiting time. Perfect resource utilization.

Consider a REALISTIC system Customers arrive in NON-optimal fashion CustomerArrives at Service Required Slightly different problem. NOTE: arrival rate results in wait/delay. Start Wait End

Practical comparisons Business waiting lines Homework assignments waiting completion Bills waiting to be paid by your income Fans trying to get into the stadium for seating at a sporting event Need for legislation waiting proper processing required by legislators

Characterizing Queueing System load Arrival rates and inter-arrival sequences Waiting line length Waiting time Time to go through the system Resource utilization

Basic tradeoff ! Desires –Customer: low waiting time (none if possible) –Resource owner: high utilization Reality –high utilization -> many demands -> waiting lines –low utilization -> low demand -> underutilized resources Tradeoff –high resource utilization –short wait time

Non-linear results The tradeoff RATE goes up significantly as demand goes up. 10% increase in load -> more than 75% increase in delay. load Wait time 50%100%

Ideal results With perfect scheduling, the delay is ZERO until saturation load Wait time 50%100% A steady-state solution reveals infinite wait. If 1 minute behind after one day, 2 minutes after 2 days, minutes after 100 days, only stops at infinity (after saturation)

Difference is customer arrival load Wait time 50%100%

Different Typical View Offered load Throughput 50%100% 50% 100% 150% ideal realistic

How does this relate to Communications? Demand : messages waiting delivery Resource : network capacity Desires: –low waiting time/delay (users don’t like waiting) –high utilization (networks are expensive) Reality: must under-utilize to have reasonable wait time and delay Use previous figure : 70% utilization –10Mbps becomes 7Mbps More Overhead

Reasonable Response Another requirement which costs us bandwidth. Typical in most computing systems. Another example: disk space –high utilization creates long access/response times –takes longer to insert a file (defragging helps)

Be Able To: Identify the fundamental components in an everyday example –resource : your time –demand : homework assignments –arrival rate : order in which assignments given –utilization : how much of your time is busy doing school work –delay : how long to complete assignments

Results Remember that results are statistical average(mean) and standard deviation are both important