<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 10:03:20 PM" dc:source="Camtasia,9.1.0,enu" dc:title="k_33ol2" tscDM:firstFrame="k_33ol2_First_Frame.png" tscDM:originId="693765A9-5AAD-46AF-9EF3-544354460A8D" tscDM:project="k_33ol2.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="1319600"/>
         <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="Interactive Response Time Law If Z = think-time, R = Response time The total cycle time of requests is R+Z" xmpDM:startTime="0" 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="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the interactive response time law" xmpDM:startTime="0" 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="4733" 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="4733" 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="4733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The system throughput is 1 jobs/sec." xmpDM:startTime="4733" 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="4733" 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="4733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.8" xmpDM:startTime="4733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.16" xmpDM:startTime="4733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5s" xmpDM:startTime="4733" 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="9400" 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="9400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the interactive response time law" xmpDM:startTime="9400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.6" xmpDM:startTime="111200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For the timesharing system of Example 33.2:" xmpDM:startTime="111200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The response time can be calculated as follows: This is the same as that obtained earlier in Example 33.5." xmpDM:startTime="111200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s" xmpDM:startTime="111200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Review of Operational Laws Operational quantities: Can be measured by operations personnel Vi = # of visits per job to" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="device i Si = Service time per job at device i Di = Total service demands per job at device" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="i = SiVi Xi = Throughput of device i X = Throughput of the system Z = User think time" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="N = Number of users in a time shared system Operational assumptions: That can be easily validated." xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="# Input = # output (flow balance) can be validated Distributions and independence can not be validated." xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Operational Laws: Relationships between operational quantities These apply regardless of distribution, burstiness, arrival patterns." xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The only assumption is flow balance." xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Utilization Law: U=XiSi = XDi Forced Flow Law: Xi = XVi Little’s Law: Qi = Xi Ri General Response Time" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Law: R = S RiVi Interactive Response Time Law: R = N/X -Z N Z VASA=DA VBSB=DB VCSC=DC A B" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="X" xmpDM:startTime="166300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example Operational quantities: Can be measured by operations personnel Vi = # of visits per job to device i =181,80" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="100 Si = Service time per job at device i = 27.6ms," xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50ms, 30ms Di = Total service demands per job at device i = SiVi = 5s, 4s, 3 s Z" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= User think time = 18s N = Number of users in a time shared system = 12 Operational Laws:" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given UA= 75%, QA=2.41," xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="QB=1.21," xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="QC=5 Utilization Law: U=XiSi = XDi X = UA/DA = 0.75/4" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs/s UC = X  DC = 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" 5 = 0.939" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="UB = X  DB = 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" 3 = 0.563" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Forced Flow Law: Xi = XVi XA = X  80 = 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" 80 = 15 jobs/s XB = X  100 = 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" 100 = 18.8" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs/s XC = X  181 = 0.188" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" 181 = 34 jobs/s Little’s Law: Qi = Xi Ri RA=QA/XA=2.41/15=0.161," xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RB=1.21/18.8=0.064," xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RC=5/34=0.147" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="General Response Time Law:R=S RiVi= 0.16180+0.064100+0.147181" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="=45.89s" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Interactive Response Time Law: R = N/X –Z = 12/0.188-18" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 45.83s" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 12 18127.6ms=5s" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="236033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C Operational quantities: Can be measured by operations personnel_ Vi = # of visits per job to device i" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 91, 50, 40 Si = Service time per job at device i = 0.044s" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=", 0.040s," xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.025s" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Z = User think time = 5s N = Number of users = 6 Operational Laws: Given UA= 48%, RA=0.0705s," xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RB=0.0323s," xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RC=0.1668s" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di = Total service demands per job at device i = SiVi DC=SCVC = _____  ___ = ___, DA=" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____  ____= ___, DB= _____  ___= ___ Utilization Law: U=XiSi = XDi X = UA/DA = _____ /" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____ = _____ jobs/s UC = X DC = _____  _____ = _____ UB = X DB = _____" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" _____ = _____ Forced Flow Law: Xi = XVi XA = X VA = _____  _____ = _____" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs/s XB = X VB = _____  _____ = _____ jobs/s XC = X VC = _____  _____" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= _____ jobs/s Little’s Law: Qi = Xi Ri QA= ____  ____ = ____, QB= ____  ____ =" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____, QC= ____  ____ = ____ General Response Time Law: R=S RiVi = ____  ____ + ____ " xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____ + ____  _____ = ____ s Interactive Response Time Law: R = N/X –Z = _____ / _____" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="- _____ = _____ s A B 5040ms 4025ms 5s 6 9144ms=4s" xmpDM:startTime="332433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis From forced flow law: The device with the highest total service demand Di has the highest utilization and" xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is called the bottleneck device." xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Delay centers can have utilizations more than one without any stability problems." xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, delay centers cannot be a bottleneck device." xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Only queueing centers used in computing Dmax." xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The bottleneck device is the key limiting factor in achieving higher throughput." xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="340600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C Operational quantities: Can be measured by operations personnel_ Vi = # of visits per job to device i" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 91, 50, 40 Si = Service time per job at device i = 0.044s" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=", 0.040s," xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.025s" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Z = User think time = 5s N = Number of users = 6 Operational Laws: Given UA= 48%, RA=0.0705s," xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RB=0.0323s," xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RC=0.1668s" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di = Total service demands per job at device i = SiVi DC=SCVC = _____  ___ = ___, DA=" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____  ____= ___, DB= _____  ___= ___ Utilization Law: U=XiSi = XDi X = UA/DA = _____ /" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____ = _____ jobs/s UC = X DC = _____  _____ = _____ UB = X DB = _____" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" _____ = _____ Forced Flow Law: Xi = XVi XA = X VA = _____  _____ = _____" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs/s XB = X VB = _____  _____ = _____ jobs/s XC = X VC = _____  _____" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= _____ jobs/s Little’s Law: Qi = Xi Ri QA= ____  ____ = ____, QB= ____  ____ =" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____, QC= ____  ____ = ____ General Response Time Law: R=S RiVi = ____  ____ + ____ " xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____ + ____  _____ = ____ s Interactive Response Time Law: R = N/X –Z = _____ / _____" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="- _____ = _____ s A B 5040ms 4025ms 5s 6 9144ms=4s" xmpDM:startTime="395400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis From forced flow law: The device with the highest total service demand Di has the highest utilization and" xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is called the bottleneck device." xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Delay centers can have utilizations more than one without any stability problems." xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, delay centers cannot be a bottleneck device." xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Only queueing centers used in computing Dmax." xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The bottleneck device is the key limiting factor in achieving higher throughput." xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="401200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont) Improving the bottleneck device will provide the highest payoff in terms of system throughput." xmpDM:startTime="416633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Improving other devices will have little effect on the system performance." xmpDM:startTime="416633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Identifying the bottleneck device should be the first step in any performance improvement project." xmpDM:startTime="416633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="416633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds Throughput and response times of the system are bound as follows: and Here, is the sum of total" xmpDM:startTime="427867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="service demands on all devices except terminals." xmpDM:startTime="427867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="427867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont) Improving the bottleneck device will provide the highest payoff in terms of system throughput." xmpDM:startTime="919767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Improving other devices will have little effect on the system performance." xmpDM:startTime="919767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Identifying the bottleneck device should be the first step in any performance improvement project." xmpDM:startTime="919767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="919767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis From forced flow law: The device with the highest total service demand Di has the highest utilization and" xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is called the bottleneck device." xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Delay centers can have utilizations more than one without any stability problems." xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, delay centers cannot be a bottleneck device." xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Only queueing centers used in computing Dmax." xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The bottleneck device is the key limiting factor in achieving higher throughput." xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="920267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C Operational quantities: Can be measured by operations personnel_ Vi = # of visits per job to device i" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 91, 50, 40 Si = Service time per job at device i = 0.044s" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=", 0.040s," xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.025s" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Z = User think time = 5s N = Number of users = 6 Operational Laws: Given UA= 48%, RA=0.0705s," xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RB=0.0323s," xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RC=0.1668s" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Di = Total service demands per job at device i = SiVi DC=SCVC = _____  ___ = ___, DA=" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____  ____= ___, DB= _____  ___= ___ Utilization Law: U=XiSi = XDi X = UA/DA = _____ /" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="_____ = _____ jobs/s UC = X DC = _____  _____ = _____ UB = X DB = _____" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" _____ = _____ Forced Flow Law: Xi = XVi XA = X VA = _____  _____ = _____" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs/s XB = X VB = _____  _____ = _____ jobs/s XC = X VC = _____  _____" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= _____ jobs/s Little’s Law: Qi = Xi Ri QA= ____  ____ = ____, QB= ____  ____ =" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____, QC= ____  ____ = ____ General Response Time Law: R=S RiVi = ____  ____ + ____ " xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="____ + ____  _____ = ____ s Interactive Response Time Law: R = N/X –Z = _____ / _____" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="- _____ = _____ s A B 5040ms 4025ms 5s 6 9144ms=4s" xmpDM:startTime="920900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis From forced flow law: The device with the highest total service demand Di has the highest utilization and" xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is called the bottleneck device." xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Delay centers can have utilizations more than one without any stability problems." xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Therefore, delay centers cannot be a bottleneck device." xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Only queueing centers used in computing Dmax." xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The bottleneck device is the key limiting factor in achieving higher throughput." xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="934267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont) Improving the bottleneck device will provide the highest payoff in terms of system throughput." xmpDM:startTime="934900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Improving other devices will have little effect on the system performance." xmpDM:startTime="934900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Identifying the bottleneck device should be the first step in any performance improvement project." xmpDM:startTime="934900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="934900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds Throughput and response times of the system are bound as follows: and Here, is the sum of total" xmpDM:startTime="935400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="service demands on all devices except terminals." xmpDM:startTime="935400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="935400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof The asymptotic bounds are based on the following observations: The utilization of any device cannot exceed one." xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the maximum obtainable throughput." xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The response time of the system with N users cannot be less than a system with just one user." xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the minimum response time." xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The interactive response time formula can be used to convert the bound on throughput to that on response time and" xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="vice versa." xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="941667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds Throughput and response times of the system are bound as follows: and Here, is the sum of total" xmpDM:startTime="944567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="service demands on all devices except terminals." xmpDM:startTime="944567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="944567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof The asymptotic bounds are based on the following observations: The utilization of any device cannot exceed one." xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the maximum obtainable throughput." xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The response time of the system with N users cannot be less than a system with just one user." xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the minimum response time." xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The interactive response time formula can be used to convert the bound on throughput to that on response time and" xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="vice versa." xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="951200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds Throughput and response times of the system are bound as follows: and Here, is the sum of total" xmpDM:startTime="967700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="service demands on all devices except terminals." xmpDM:startTime="967700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="967700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof The asymptotic bounds are based on the following observations: The utilization of any device cannot exceed one." xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the maximum obtainable throughput." xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The response time of the system with N users cannot be less than a system with just one user." xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the minimum response time." xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The interactive response time formula can be used to convert the bound on throughput to that on response time and" xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="vice versa." xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="974767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds Throughput and response times of the system are bound as follows: and Here, is the sum of total" xmpDM:startTime="992300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="service demands on all devices except terminals." xmpDM:startTime="992300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="992300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof The asymptotic bounds are based on the following observations: The utilization of any device cannot exceed one." xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the maximum obtainable throughput." xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The response time of the system with N users cannot be less than a system with just one user." xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This puts a limit on the minimum response time." xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The interactive response time formula can be used to convert the bound on throughput to that on response time and" xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="vice versa." xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1005633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof (Cont) 1." xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For the bottleneck device b: Since Ub cannot be more than one: 2." xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="With just one job in the system, there is no queueing and the system response time is simply the sum" xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the service demands: With more than one user there may be some queueing and so the response time will" xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="be higher." xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="That is: # of users X 1/Dmax # of users R D" xmpDM:startTime="1017000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof (Cont) 3." xmpDM:startTime="1044033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applying the interactive response time law to the bounds: R = (N/X) - Z # of users X 1/Dmax #" xmpDM:startTime="1044033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of users R D" xmpDM:startTime="1044033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Operating Point The number of jobs N* at the knee is given by: If the number of jobs is" xmpDM:startTime="1069267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more than N*, then we can say with certainty that there is queueing somewhere in the system." xmpDM:startTime="1069267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The asymptotic bounds can be easily explained to people who do not have any background in queueing theory or performance" xmpDM:startTime="1069267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="analysis." xmpDM:startTime="1069267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Control Strategy: Increase N iff dP/dN is positive Power =X/R Number of Users X R" xmpDM:startTime="1069267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7" xmpDM:startTime="1191533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For the timesharing system of Example 33.2:" xmpDM:startTime="1191533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The asymptotic bounds are: A B 8050ms 10030ms 18s 17 181…=5s" xmpDM:startTime="1191533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7:" xmpDM:startTime="1228533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds The knee occurs at:" xmpDM:startTime="1228533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1261833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How many terminals can be supported on the timesharing system of Example 33.2" xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="if the response time has to be kept below 100 seconds? Using the asymptotic bounds on the response time we" xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="get: The response time will be more than 100, if: That is, if: the response time is bound to be" xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more than 100." xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the system cannot support more than 23 users if a response time of less than 100 is required." xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s" xmpDM:startTime="1265300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1281533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7:" xmpDM:startTime="1281900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds The knee occurs at:" xmpDM:startTime="1281900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1291700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How many terminals can be supported on the timesharing system of Example 33.2" xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="if the response time has to be kept below 100 seconds? Using the asymptotic bounds on the response time we" xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="get: The response time will be more than 100, if: That is, if: the response time is bound to be" xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more than 100." xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the system cannot support more than 23 users if a response time of less than 100 is required." xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s" xmpDM:startTime="1292467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1304033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7:" xmpDM:startTime="1304400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds The knee occurs at:" xmpDM:startTime="1304400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1309900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How many terminals can be supported on the timesharing system of Example 33.2" xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="if the response time has to be kept below 100 seconds? Using the asymptotic bounds on the response time we" xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="get: The response time will be more than 100, if: That is, if: the response time is bound to be" xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more than 100." xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus, the system cannot support more than 23 users if a response time of less than 100 is required." xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B 8050ms 10030ms 18s 17 181…=5s" xmpDM:startTime="1310333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33E For this system, which device would be the bottleneck if: The CPU is replaced by another unit that" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is twice as fast? _____ Disk A is replaced by another unit that is twice as slow? ______ Disk B" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is replaced by another unit that is twice as slow? ______ The memory size is reduced so that the jobs" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="make 25 times more visits to disk B due to increased page faults? _______ A B 0.1s" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.6s" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5s 1s" xmpDM:startTime="1310800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Symbols:" xmpDM:startTime="1311533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33E For this system, which device would be the bottleneck if: The CPU is replaced by another unit that" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is twice as fast? _____ Disk A is replaced by another unit that is twice as slow? ______ Disk B" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is replaced by another unit that is twice as slow? ______ The memory size is reduced so that the jobs" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="make 25 times more visits to disk B due to increased page faults? _______ A B 0.1s" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0.6s" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5s 1s" xmpDM:startTime="1312400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Symbols:" xmpDM:startTime="1314033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides thankyou Raj Jain http://rajjain.com" xmpDM:startTime="1314500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1314500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Symbols:" xmpDM:startTime="1315133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides thankyou Raj Jain http://rajjain.com" xmpDM:startTime="1316500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1316500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Symbols:" xmpDM:startTime="1317733" 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="Interactive Response Time Law" xmpDM:startTime="0" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33B" xmpDM:startTime="4733" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Interactive Response Time Law" xmpDM:startTime="9400" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.6" xmpDM:startTime="111200" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Review of Operational Laws" xmpDM:startTime="166300" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example" xmpDM:startTime="236033" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C" xmpDM:startTime="332433" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis" xmpDM:startTime="340600" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C" xmpDM:startTime="395400" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis" xmpDM:startTime="401200" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont)" xmpDM:startTime="416633" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds" xmpDM:startTime="427867" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont)" xmpDM:startTime="919767" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis" xmpDM:startTime="920267" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33C" xmpDM:startTime="920900" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis" xmpDM:startTime="934267" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bottleneck Analysis (Cont)" xmpDM:startTime="934900" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds" xmpDM:startTime="935400" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof" xmpDM:startTime="941667" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds" xmpDM:startTime="944567" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof" xmpDM:startTime="951200" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds" xmpDM:startTime="967700" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof" xmpDM:startTime="974767" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds" xmpDM:startTime="992300" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Asymptotic Bounds: Proof" xmpDM:startTime="1005633" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof (Cont)" xmpDM:startTime="1017000" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof (Cont)" xmpDM:startTime="1044033" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Operating Point" xmpDM:startTime="1069267" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7" xmpDM:startTime="1191533" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7: Asymptotic Bounds" xmpDM:startTime="1228533" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33D" xmpDM:startTime="1261833" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1265300" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33D" xmpDM:startTime="1281533" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7: Asymptotic Bounds" xmpDM:startTime="1281900" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33D" xmpDM:startTime="1291700" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1292467" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33D" xmpDM:startTime="1304033" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.7: Asymptotic Bounds" xmpDM:startTime="1304400" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33D" xmpDM:startTime="1309900" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 33.8" xmpDM:startTime="1310333" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33E" xmpDM:startTime="1310800" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="1311533" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 33E" xmpDM:startTime="1312400" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="1314033" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides" xmpDM:startTime="1314500" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="1315133" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides" xmpDM:startTime="1316500" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="1317733" tscDM:image="k_33ol2_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 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_33ol2.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="k_33ol2_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="k_33ol2_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>