<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2017-11-11 09:37:08 PM" dc:source="Camtasia,9.1.0,enu" dc:title="k_33ol1" tscDM:firstFrame="k_33ol1_First_Frame.png" tscDM:originId="693765A9-5AAD-46AF-9EF3-544354460A8D" tscDM:project="k_33ol1.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="2779600"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="1080" stDim:w="1440"/>
         <tsc:langName>
            <rdf:Bag>
               <rdf:li xml:lang="en-US">English</rdf:li></rdf:Bag>
         </tsc:langName>
         <xmpDM:Tracks>
            <rdf:Bag>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="ScreenText" xmpDM:frameRate="f1000" xmpDM:trackName="Screen Text">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Operational Laws Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-17/" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview What is an Operational Law? Utilization Law Forced Flow Law Little’s Law General Response Time Law Interactive Response Time" xmpDM:startTime="6200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Law Bottleneck Analysis" xmpDM:startTime="6200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational Laws Relationships that do not require any assumptions about the distribution of service times or inter-arrival times." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Identified originally by Buzen (1976) and later extended by Denning and Buzen (1978)." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational  Directly measured." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operationally testable assumptions  assumptions that can be verified by measurements." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example, whether number of arrivals is equal to the number of completions? This assumption, called job flow balance, is" xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="operationally testable." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A set of observed service times is or is not a sequence of independent random variables is not is not" xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="operationally testable." xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="44600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational Quantities Quantities that can be directly measured during a finite observation period." xmpDM:startTime="207233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="T = Observation interval Ai = Number of arrivals Ci = Number of completions Bi = Busy time Bi Black" xmpDM:startTime="207233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box" xmpDM:startTime="207233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Utilization Law This is one of the operational laws Operational laws are similar to the elementary laws of motion For" xmpDM:startTime="373333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="example, Notice that distance d, acceleration a, and time t are operational quantities." xmpDM:startTime="373333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="No need to consider them as expected values of random variables or to assume a distribution." xmpDM:startTime="373333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="373333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.1" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Consider a network gateway at which the packets arrive at a rate of 125 packets per second and the gateway" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="takes an average of two milliseconds to forward them." xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Throughput Xi = Exit rate = Arrival rate = 125 packets/second Service time Si = 0.002" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second Utilization Ui= Xi Si = 125  0.002" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.25" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 25% This result is valid for any arrival or service process." xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Even if inter-arrival times and service times to are not IID random variables with exponential distribution." xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="566200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Forced Flow Law Relates the system throughput to individual device throughputs." xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In an open model, System throughput = # of jobs leaving the system per unit time In a closed model," xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="System throughput = # of jobs traversing OUT to IN link per unit time." xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If observation period T is such that Ai = Ci  Device satisfies the assumption of job flow balance." xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each job makes Vi requests for ith device in the system Ci = C0 Vi or Vi =Ci/C0 Vi is" xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="called visit ratio C0 Ci C0" xmpDM:startTime="677933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Forced Flow Law (Cont) Throughput of ith device: In other words: This is the forced flow law." xmpDM:startTime="815000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="815000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Device Combining the forced flow law and the utilization law, we get: Here Di=Vi Si is the total service" xmpDM:startTime="909500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="demand on the device for all visits of a job." xmpDM:startTime="909500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The device with the highest Di has the highest utilization and is the bottleneck device." xmpDM:startTime="909500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="909500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a timesharing system, accounting log data produced the following profile for user programs." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each program requires five seconds of CPU time, makes 80 I/O requests to the disk A and 100 I/O requests" xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to disk B." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Average think-time of the users was 18 seconds." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="From the device specifications, it was determined that disk A takes 50 milliseconds to satisfy an I/O request and the" xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk B takes 30 milliseconds per request." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="With 17 active terminals, disk A throughput was observed to be 15.70" xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="I/O requests per second." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="We want to find the system throughput and device utilizations." xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 ……=5s" xmpDM:startTime="1098833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1422167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Cont) Since the jobs must visit the CPU before going to the disks or terminals, the CPU visit ratio is:" xmpDM:startTime="1422167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the forced flow law, the throughputs are: Using the utilization law, the device utilizations are: A B 8050ms 10030ms" xmpDM:startTime="1422167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="18s 17 ……=5s" xmpDM:startTime="1422167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="1722033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="1729600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="1729600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="1729600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="1729600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="1734467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1824167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Cont) Since the jobs must visit the CPU before going to the disks or terminals, the CPU visit ratio is:" xmpDM:startTime="1824167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the forced flow law, the throughputs are: Using the utilization law, the device utilizations are: A B 8050ms 10030ms" xmpDM:startTime="1824167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="18s 17 ……=5s" xmpDM:startTime="1824167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a timesharing system, accounting log data produced the following profile for user programs." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each program requires five seconds of CPU time, makes 80 I/O requests to the disk A and 100 I/O requests" xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to disk B." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Average think-time of the users was 18 seconds." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="From the device specifications, it was determined that disk A takes 50 milliseconds to satisfy an I/O request and the" xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk B takes 30 milliseconds per request." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="With 17 active terminals, disk A throughput was observed to be 15.70" xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="I/O requests per second." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="We want to find the system throughput and device utilizations." xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 ……=5s" xmpDM:startTime="1824533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1836933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Cont) Since the jobs must visit the CPU before going to the disks or terminals, the CPU visit ratio is:" xmpDM:startTime="1836933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the forced flow law, the throughputs are: Using the utilization law, the device utilizations are: A B 8050ms 10030ms" xmpDM:startTime="1836933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="18s 17 ……=5s" xmpDM:startTime="1836933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="1837833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="1881600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="1881600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="1881600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="1881600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="1897400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="1944100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="1944100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="1944100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="1944100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) Since each visit to the outside link is defined as the completion of the job, we have:" xmpDM:startTime="1995533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These are called visit ratio equations In central server models, after completion of service at every queue, the jobs always" xmpDM:startTime="1995533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="move back to the CPU queue: A B V0 p10 pB1 pA1 p1A p1B 1" xmpDM:startTime="1995533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) The above probabilities apply to exit and entrances from the system (i=0), also." xmpDM:startTime="2075933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, the visit ratio equations become: Thus, we can find the visit ratios by dividing the probability p1j of moving" xmpDM:startTime="2075933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to jth queue from CPU by the exit probability p10." xmpDM:startTime="2075933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 3 V0 p10 p31 p21 p12 p13 1" xmpDM:startTime="2075933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Consider the queueing network: The visit ratios are VA=80, VB=100, and VCPU=181." xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="After completion of service at the CPU the probabilities of the job moving to disk A, disk B, or terminals" xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="are 80/181, 100/181, and 1/181, respectively." xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the transition probabilities are p1A=0.4420," xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p1B=0.5525," xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and p10=0.005525." xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given the transition probabilities, we can find the visit ratios by dividing these probabilities by the exit probability (0.005525):" xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2143800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law If the job flow is balanced, the arrival rate is equal to the throughput and we can write:" xmpDM:startTime="2231933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2231933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Consider the queueing network: The visit ratios are VA=80, VB=100, and VCPU=181." xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="After completion of service at the CPU the probabilities of the job moving to disk A, disk B, or terminals" xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="are 80/181, 100/181, and 1/181, respectively." xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the transition probabilities are p1A=0.4420," xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p1B=0.5525," xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and p10=0.005525." xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given the transition probabilities, we can find the visit ratios by dividing these probabilities by the exit probability (0.005525):" xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2310667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) The above probabilities apply to exit and entrances from the system (i=0), also." xmpDM:startTime="2311333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, the visit ratio equations become: Thus, we can find the visit ratios by dividing the probability p1j of moving" xmpDM:startTime="2311333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to jth queue from CPU by the exit probability p10." xmpDM:startTime="2311333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 3 V0 p10 p31 p21 p12 p13 1" xmpDM:startTime="2311333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) Since each visit to the outside link is defined as the completion of the job, we have:" xmpDM:startTime="2311800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These are called visit ratio equations In central server models, after completion of service at every queue, the jobs always" xmpDM:startTime="2311800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="move back to the CPU queue: A B V0 p10 pB1 pA1 p1A p1B 1" xmpDM:startTime="2311800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="2312333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="2312333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="2312333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="2312333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="2312833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="2313367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Cont) Since the jobs must visit the CPU before going to the disks or terminals, the CPU visit ratio is:" xmpDM:startTime="2313367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the forced flow law, the throughputs are: Using the utilization law, the device utilizations are: A B 8050ms 10030ms" xmpDM:startTime="2313367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="18s 17 ……=5s" xmpDM:startTime="2313367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="2314733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="2315300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="2315300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="2315300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="2315300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A The visit ratios and service time per visit for a system are as shown: For each device what" xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the total service demand: CPU: Vi = _______, Si= _______, Di= _______ Disk A: Vi = _______, Si= _______," xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di= _______ Disk B: Vi = _______, Si= _______, Di= _______ Terminals: Vi = _______, Si= _______, Di= _______ If" xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A utilization is 50%, what’s the utilization of CPU and Disk B? XA = UA/DA =_______ UCPU = X" xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCPU = _______ UB = X DB = _______ What is the bottleneck device? _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi" xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 425ms 2030ms …40ms 5s" xmpDM:startTime="2335733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities pij = Probability of a job moving to jth queue after service completion at ith queue Visit ratios" xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and transition probabilities are equivalent in the sense that given one we can always find the other." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a system with job flow balance: i = 0  visits to the outside link pi0 = Probability of" xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a job exiting from the system after completion of service at ith device Dividing by C0 we get:" xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) Since each visit to the outside link is defined as the completion of the job, we have:" xmpDM:startTime="2373733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These are called visit ratio equations In central server models, after completion of service at every queue, the jobs always" xmpDM:startTime="2373733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="move back to the CPU queue: A B V0 p10 pB1 pA1 p1A p1B 1" xmpDM:startTime="2373733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont) The above probabilities apply to exit and entrances from the system (i=0), also." xmpDM:startTime="2374033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, the visit ratio equations become: Thus, we can find the visit ratios by dividing the probability p1j of moving" xmpDM:startTime="2374033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to jth queue from CPU by the exit probability p10." xmpDM:startTime="2374033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 3 V0 p10 p31 p21 p12 p13 1" xmpDM:startTime="2374033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Consider the queueing network: The visit ratios are VA=80, VB=100, and VCPU=181." xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="After completion of service at the CPU the probabilities of the job moving to disk A, disk B, or terminals" xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="are 80/181, 100/181, and 1/181, respectively." xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the transition probabilities are p1A=0.4420," xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p1B=0.5525," xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and p10=0.005525." xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given the transition probabilities, we can find the visit ratios by dividing these probabilities by the exit probability (0.005525):" xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2374333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law If the job flow is balanced, the arrival rate is equal to the throughput and we can write:" xmpDM:startTime="2374767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2374767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.4" xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The average queue length in the computer system of Example 33.2" xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="was observed to be: 8.88," xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3.19," xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and 1.40" xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs at the CPU, disk A, and disk B, respectively." xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What were the response times of these devices? In Example 33.2," xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the device throughputs were determined to be: The new information given in this example is: Using Little's law, the device" xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="response times are: A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2421767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law If the job flow is balanced, the arrival rate is equal to the throughput and we can write:" xmpDM:startTime="2450267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2450267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Consider the queueing network: The visit ratios are VA=80, VB=100, and VCPU=181." xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="After completion of service at the CPU the probabilities of the job moving to disk A, disk B, or terminals" xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="are 80/181, 100/181, and 1/181, respectively." xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the transition probabilities are p1A=0.4420," xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p1B=0.5525," xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and p10=0.005525." xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given the transition probabilities, we can find the visit ratios by dividing these probabilities by the exit probability (0.005525):" xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2454533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law If the job flow is balanced, the arrival rate is equal to the throughput and we can write:" xmpDM:startTime="2456767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2456767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.4" xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The average queue length in the computer system of Example 33.2" xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="was observed to be: 8.88," xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3.19," xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and 1.40" xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs at the CPU, disk A, and disk B, respectively." xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What were the response times of these devices? In Example 33.2," xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the device throughputs were determined to be: The new information given in this example is: Using Little's law, the device" xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="response times are: A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2457367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law There is one terminal per user and the rest of the system is shared by all" xmpDM:startTime="2503133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="users." xmpDM:startTime="2503133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applying Little's law to the central subsystem: Q = X R Here, Q = Total number of jobs in the" xmpDM:startTime="2503133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="system R = system response time X = system throughput" xmpDM:startTime="2503133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont) Dividing both sides by X and using forced flow law: or, This is called the" xmpDM:startTime="2522233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="general response time law." xmpDM:startTime="2522233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2522233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law There is one terminal per user and the rest of the system is shared by all" xmpDM:startTime="2526267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="users." xmpDM:startTime="2526267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applying Little's law to the central subsystem: Q = X R Here, Q = Total number of jobs in the" xmpDM:startTime="2526267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="system R = system response time X = system throughput" xmpDM:startTime="2526267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont) Dividing both sides by X and using forced flow law: or, This is called the" xmpDM:startTime="2614367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="general response time law." xmpDM:startTime="2614367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2614367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law There is one terminal per user and the rest of the system is shared by all" xmpDM:startTime="2616267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="users." xmpDM:startTime="2616267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applying Little's law to the central subsystem: Q = X R Here, Q = Total number of jobs in the" xmpDM:startTime="2616267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="system R = system response time X = system throughput" xmpDM:startTime="2616267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont) Dividing both sides by X and using forced flow law: or, This is called the" xmpDM:startTime="2619600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="general response time law." xmpDM:startTime="2619600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2619600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.5" xmpDM:startTime="2668733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Let us compute the response time for the timesharing system of Example 33.4" xmpDM:startTime="2668733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For this system: The system response time is: The system response time is 68.6" xmpDM:startTime="2668733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="seconds." xmpDM:startTime="2668733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s p10 p1A p1B" xmpDM:startTime="2668733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33B The transition probabilities of jobs exiting CPU and device service times are as shown." xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the visit ratios: VA= p1A/p10 = ________ VB = p1B/p10 = _______ VCPU =1+VA+VB=_______ The queue lengths at CPU," xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="disk A, and disk B was observed to be 6, 3, and 1, respectively." xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The system throughput is 1 jobs/sec." xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the system response time? RCPU=QCPU/XCPU=QCPU/(XVCPU) = _______ RA=QA/(XA) = _______ RB=QB/(XB) = _______ R = RCPUVCPU+RAVA+RBVB = _______" xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Check: Q=X R _______ Key: Ui=XiSi=XDi, Di=SiVi, X= Xi/Vi, Qi=XiRi, A B 25ms 30ms 40ms 0.04" xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.8" xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.16" xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5s" xmpDM:startTime="2693533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Interactive Response Time Law If Z = think-time, R = Response time The total cycle time of requests is R+Z" xmpDM:startTime="2698700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each user generates about T/(R+Z) requests in T If there are N users: or R = (N/X) - Z This" xmpDM:startTime="2698700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the interactive response time law" xmpDM:startTime="2698700" xmpDM:duration="1000"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="TableOfContents" xmpDM:frameRate="f1000" xmpDM:trackName="Table of Contents">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Operational Laws" xmpDM:startTime="0" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview" xmpDM:startTime="6200" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational Laws" xmpDM:startTime="44600" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational Quantities" xmpDM:startTime="207233" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Utilization Law" xmpDM:startTime="373333" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.1 " xmpDM:startTime="566200" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Forced Flow Law" xmpDM:startTime="677933" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Forced Flow Law (Cont)" xmpDM:startTime="815000" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Device" xmpDM:startTime="909500" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1098833" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2 (Cont)   " xmpDM:startTime="1422167" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="1722033" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="1729600" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="1734467" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2 (Cont)   " xmpDM:startTime="1824167" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2" xmpDM:startTime="1824533" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2 (Cont)   " xmpDM:startTime="1836933" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="1837833" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="1881600" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="1897400" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="1944100" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="1995533" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="2075933" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2143800" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2231933" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2310667" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="2311333" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="2311800" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="2312333" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="2312833" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.2 (Cont)   " xmpDM:startTime="2313367" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="2314733" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="2315300" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33A" xmpDM:startTime="2335733" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities" xmpDM:startTime="2373100" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="2373733" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transition Probabilities (Cont)" xmpDM:startTime="2374033" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2374333" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2374767" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.4" xmpDM:startTime="2421767" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2450267" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.3" xmpDM:startTime="2454533" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2456767" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.4" xmpDM:startTime="2457367" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law" xmpDM:startTime="2503133" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont)" xmpDM:startTime="2522233" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law" xmpDM:startTime="2526267" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont)" xmpDM:startTime="2614367" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law" xmpDM:startTime="2616267" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law (Cont)" xmpDM:startTime="2619600" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.5" xmpDM:startTime="2668733" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33B" xmpDM:startTime="2693533" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Interactive Response Time Law" xmpDM:startTime="2698700" tscDM:image="k_33ol1_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="true"/><rdf:li xmpDM:name="autoplay" xmpDM:value="false"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="k_33ol1.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="k_33ol1_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="k_33ol1_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>