Performance Engineering

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

CMT603 Lecture 3 Scheduling. Contents Intro to scheduling Preemption Scheduling Algorithms –?–? –?–? –?–?
Topic : Process Management Lecture By: Rupinder Kaur Lecturer IT, SRS Govt. Polytechnic College for Girls,Ludhiana.
10. 5: Model Solution Model Interpretation 10
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Chapter Queueing Notation
Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
CS 241 Spring 2007 System Programming 1 Queuing Framework for Process Management Evaluation Lecture 20 Klara Nahrstedt.
INDR 343 Problem Session
10/12/1999(c) Ian Davis1 Predicting performance Topics: –Operational analysis of network models –Markov models.
Queueing Model 박희경.
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.
1 Part II Web Performance Modeling: basic concepts © 1998 Menascé & Almeida. All Rights Reserved.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Single queue modeling. Basic definitions for performance predictions The performance of a system that gives services could be seen from two different.
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.
Performance Evaluation
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
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.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Operational Laws A large number of day-to-day problem in computer systems performance analysis can be solved by using some simple relationships that do.
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
1 Part VI System-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
Buffer or Suffer Principle
Introduction to Queuing Theory
QueueTraffic and queuing theory +. 2 Queues in everyday life You have certainly been in a queue somewhere. –Where? –How were they different?  We encounter.
AN INTRODUCTION TO THE OPERATIONAL ANALYSIS OF QUEUING NETWORK MODELS Peter J. Denning, Jeffrey P. Buzen, The Operational Analysis of Queueing Network.
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Introduction to Queuing Theory
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Lecture 10: Queueing Theory. Queueing Analysis Jobs serviced by the system resources Jobs wait in a queue to use a busy server queueserver.
CSE 538 Instructor: Roch Guerin – Office hours: Mon & Wed 4:00-5:00pm in Bryan 509 TA: Junjie Liu
Ch 6 Tech Notes OBJECTIVES
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
CPU Scheduling Gursharan Singh Tatla 1-Feb-20111www.eazynotes.com.
1 Challenges in Scaling E-Business Sites  Menascé and Almeida. All Rights Reserved. Daniel A. Menascé Department of Computer Science George Mason.
Simulation with ArenaChapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Simulation by Hand: Setup.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.
Chapter 3 System Performance and Models Introduction A system is the part of the real world under study. Composed of a set of entities interacting.
1 Part VII Component-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
Capacity Planning Plans Capacity Planning Operational Laws
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web (Book, Chapter 8)
Review Session Jehan-François Pâris. Agenda Statistical Analysis of Outputs Operational Analysis Case Studies Linear Regression.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part II System Performance Modeling: basic concepts, operational analysis (book, chap. 3)
QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,
Queuing Theory Simulation & Modeling.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web.
OPERATING SYSTEMS CS 3502 Fall 2017
CSE 538 Instructor: Roch Guerin
Chapter 3: Process-Concept
Discrete Event Simulation
Performance Engineering
Queuing Theory Queuing Theory.
Chapter 2 Scheduling.
OPERATING SYSTEMS SCHEDULING
B.Ramamurthy Appendix A
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Solutions Queueing Theory 1
SLACK 4 Process Mapping.
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Carey Williamson Department of Computer Science University of Calgary
CS 704 Advanced Computer Architecture
Chapter 6: Scheduling Algorithms Dr. Amjad Ali
Presentation transcript:

Performance Engineering Performance Metrics Prof. Jerry Breecher Performance Metrics

All About Numbers Performance Metrics

Arrivals ------> SYSTEM ------> Departures PERFORMANCE METRICS In this section, a few of the metrics of performance are described. Along with these metrics are some simple equations that connect together the various quantities. We will continue to talk about metrics in a later section. In fact, when we get to talking about queues, we’ll be spending lots of time looking at the interrelations of these concepts.   Arrivals ------> SYSTEM ------> Departures T is the length of TIME we observed the system. A is the number of request ARRIVALS observed. C is the number of request DEPARTURES observed. W the ACCUMULATED TIME for all requests within the system - time spent both waiting for and using resources. It is  S requests[ Tdeparture – Tarrival] Performance Metrics

Arrivals ------> RESOURCE ------> Departures PERFORMANCE METRICS   Arrivals ------> RESOURCE ------> Departures B is the length of time that the resource was observed to be BUSY. Note that the pictures may be equivalent; a system may have only one resource. A request is presented to a system ( in which case it might be called a "job") or is presented to a particular resource. Performance Metrics

PERFORMANCE METRICS Metric Description Formula Units Arrival Rate   Arrival Rate How many requests arrive per time. Y = A / T Requests/second Throughput (Departure Rate) How many requests complete per time. X = C / T Utilization Fraction of time the resource is in use. U = B / T Number in range 0 - 1. Service Requirement Time needed by a resource to handle a request. S = B / C Seconds Requests in system Average number of requests in the system. N = W / T Dimensionless Residence time Average time a request spends in the system. R = W / C Performance Metrics

PERFORMANCE METRICS Note that requests are serviced Example:   Requests 3 | | 2 | ----------------- ----------------- 1 | ----------------- ----------------- ----------------- +---------------------------------------------------------------------------- 0 1 2 3 4 5 6 7 8 9 10 Time ( seconds ) Note that requests are serviced simultaneously - it's a multiprocessor? What are: T Time interval = A Arrivals = C Completions = B Time spent servicing = requests   Y = A / T Arrival rate = X = C / T Throughput = U = B / T Utilization = S = B / C Service time/request = Performance Metrics

PERFORMANCE METRICS UTILIZATION LAW U = X S   UTILIZATION LAW U = X S Proof: B / T = C / T * B / C Example: The server of dinners in the Cafeteria keeps busy 75% of the time between 12:00 and 1:00. During this time 90 people are served a dinner. How long does it take to serve each customer? Performance Metrics

PERFORMANCE METRICS Requests 3 | --------- | | 3 | 3 | --------- | | 3 | 2 | ------------------------ | | 2 | 3 | 1 | ---------------------------------------------- | | 1 | 2 | 3 | +--------------------------------------------------------------------------------- 0 1 2 3 4 5 6 7 8 9 10 Time ( seconds ) Y = A / T Arrival rate = X = C / T Throughput = R = W / C Residence Time = U = B / T Utilization = S = B / C Service time/request = N = W / T Average number of = requests in the system.   T Time interval = A Arrivals = C Completions = B Time spent servicing = requests W Accumulated time = within system Performance Metrics

PERFORMANCE METRICS LITTLE’S LAW N = X R Proof: W / T = C / T * W / C    LITTLE’S LAW N = X R   Proof: W / T = C / T * W / C Example: On an average day in the Cafeteria, four people are waiting in the sandwich line. Each of the two sandwich makers can produce a sandwich in one minute. How long must the diners wait in line until they are handed a sandwich? How many sandwiches can be produced in one hour? Performance Metrics

PERFORMANCE METRICS Example:   Example: One day I was at the Weston Toll Booth on the Mass Pike. There were 10 collectors working; when I joined the line, there were 8 cars ahead of me, and when my turn came it took me 12 seconds to pay my toll. What information can be derived from the above paragraph? What information can NOT be deduced? Recently it was reported that the current U.S. Marriage rate is 6.8 per 100 adults and the divorce rate is 3.6 per 1000 adults. It was also reported that 48% of all adults are currently married. Develop a simple model/picture in order to make some sense of these numbers. Performance Metrics

PERFORMANCE METRICS Some more practice problems: Example: Packets arrive at a gateway at a rate of 125 packets/second. The gateway takes an average of 2 milliseconds to forward them.   What is the Throughput, Service Time, and Utilization. A system has a CPU, Disk A, and Disk B. The throughputs of these devices are XCPU = 35.48, XA = 15.70, XB = 19.6. We also know that the Queue lengths are QCPU = 8.88, QA = 3.19, QB = 1.40. What are the device response times for these devices? On the campus, there are a number of graduate students who have varying degree and course requirements. Build a model using duration of time until their degree, as well as the fraction of time in school. What is the service time, residence time, of a graduate student? What is the throughput of the CS Graduate School? Performance Metrics

SUMMARY OF PERFORMANCE METRICS   T is the length of TIME we observed the system. A is the number of request ARRIVALS observed. C is the number of request DEPARTURES observed. W is the ACCUMULATED TIME for all requests within the system - time spent both waiting for and using resources. B is the length of time that the resource was observed to be BUSY. Arrival Rate Y = A / T Throughput (Departure Rate) X = C / T Utilization U = B / T Service Requirement S = B / C Requests in system N = W / T Residence time R = W / C UTILIZATION LAW U = X S LITTLE’S LAW N= X R Performance Metrics