Review. Why can average request time be used to determine the work-load required for saturation?

Slides:



Advertisements
Similar presentations
Circling Back To Littles Law Now that we have tools to gather information.
Advertisements

Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.
CH 5. CPU Scheduling Basic Concepts F CPU Scheduling  context switching u CPU switching for another process u saving old PCB and loading.
CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,
A. Frank - P. Weisberg Operating Systems Advanced CPU Scheduling.
 Basic Concepts  Scheduling Criteria  Scheduling Algorithms.
Operating Systems Chapter 6
Chap 5 Process Scheduling. Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU–I/O Burst Cycle – Process execution consists of a.
Performance Engineering Methodology Chapter 4. Performance Engineering Performance engineering analyzes the expected performance characteristics of a.
CSE 807 Bounds on Performance1. 2 Significance of Bounds Provide valuable insight into the primary factors affecting the performance of computer system.
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Performance Evaluation
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Computer System Lifecycle Chapter 1. Introduction Computer System users, administrators, and designers are all interested in performance evaluation. Whether.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Basic Concepts Maximum CPU utilization.
CPU-Scheduling Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The short term scheduler.
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Scheduler What is the job of.
Adaptive Overload Control for Busy Internet Servers Matt Welsh and David Culler USENIX Symposium on Internet Technologies and Systems (USITS) 2003 Alex.
CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times.
Chapter 5 Processor Scheduling Introduction Processor (CPU) scheduling is the sharing of the processor(s) among the processes in the ready queue.
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 5: CPU Scheduling Basic.
1 Components performance modelling - Outline of queue networks - Mean Value Analisys (MVA) for open and close queue networks.
1 Part VII Component-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
Penny Fab WIP=1.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
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.
Little’s Law & Operational Laws. Little’s Law Proportionality relation between the average number of jobs (E[N]) in a system and the average system time.
CPU Algorithm Turnaround time :- Amount of time to execute a particular process. Waiting time – amount of time a process has been waiting in the ready.
Purpose of Operating System Part 2 Monil Adhikari.
CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.
网上报账系统包括以下业务: 日常报销 差旅费报销 借款业务 1. 填写报销内容 2. 选择支付方式 (或冲销借款) 3. 提交预约单 4. 打印预约单并同分类粘 贴好的发票一起送至财务 处 预约报销步骤: 网上报账系统 薪酬发放管理系统 财务查询系统 1.
Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.
CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.
Windows Version 3.1
Abhinav Kamra, Vishal Misra CS Department Columbia University
Copyright ©: Nahrstedt, Angrave, Abdelzaher
Process Scheduling B.Ramamurthy 9/16/2018.
Scheduling (Priority Based)
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Operating System Concepts
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Chapter 6: CPU Scheduling
Exercise Ms.Reema alOraini
Chapter 5: CPU Scheduling
Process Scheduling B.Ramamurthy 2/23/2019.
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: Scheduling Algorithms Dr. Amjad Ali
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
CPU Scheduling.
Module 5: CPU Scheduling
Chapter 5: CPU Scheduling
Presentation transcript:

Review

Why can average request time be used to determine the work-load required for saturation?

Time (ms) Type A requests : 2ms CPU time (occur 90% of the time) Type B requests : 200ms CPU time (occur 10% of the time) Average Request Time = (0.9 * 2) + (0.1 * 200) = 21.8ms

Reduce inter-request arrival period to 2oms from 100ms

Average Request Time = (0.9 * 2) + (0.1 * 200) = 21.8ms Time (ms) Type A requests : 2ms CPU time (occur 90% of the time) Type B requests : 200ms CPU time (occur 10% of the time) requests in queue at 200 ms At 200ms we have to process 10 requests within 20ms. 10 requests will take milliseconds. We cannot process all requests in the queue before the next 10ms request comes in. This means from now on queue size will keep increasing at a constant rate, meaning response time will increase at a constant rate for upcoming incoming requests. Note that throughput stays the same and does not increase to cope with increased load (increased load => 1 request every 20ms). That is what we mean by saturation.

Average request must complete before another request arrives in order to prevent system saturation i.e.: Average request time < Inter-request arrival period