Lecture 9 Multiple Class Models

Similar documents
Professor Wei Zhu. 1. Sampling from the Normal Population

EP2200 Queueing theory and teletraffic systems. Queueing networks. Viktoria Fodor KTH EES/LCN KTH EES/LCN

= y and Normed Linear Spaces

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi

Fairing of Parametric Quintic Splines

Non-axial symmetric loading on axial symmetric. Final Report of AFEM

Minimizing spherical aberrations Exploiting the existence of conjugate points in spherical lenses

Outline. Basic Components of a Queue. Queueing Notation. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.

RECAPITULATION & CONDITIONAL PROBABILITY. Number of favourable events n E Total number of elementary events n S

Consider two masses m 1 at x = x 1 and m 2 at x 2.

Lecture 10: Condensed matter systems

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

The Linear Probability Density Function of Continuous Random Variables in the Real Number Field and Its Existence Proof

Recent Advances in Computers, Communications, Applied Social Science and Mathematics

Lecture 12: Spiral: Domain Specific HLS. Housekeeping

CE 561 Lecture Notes. Optimal Timing of Investment. Set 3. Case A- C is const. cost in 1 st yr, benefits start at the end of 1 st yr

NUMERICAL SIMULATION OF TSUNAMI CURRENTS AROUND MOVING STRUCTURES

Atomic units The atomic units have been chosen such that the fundamental electron properties are all equal to one atomic unit.

IS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model

Trace of Positive Integer Power of Adjacency Matrix

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

Analysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems

7. Queueing and sharing systems. ELEC-C7210 Modeling and analysis of communication networks 1

SYSTEMS OF NON-LINEAR EQUATIONS. Introduction Graphical Methods Close Methods Open Methods Polynomial Roots System of Multivariable Equations

Connectionist Models. Artificial Neural Networks. When to Consider Neural Networks. Decision Surface of Perceptron. Perceptron

Question 1. Typical Cellular System. Some geometry TELE4353. About cellular system. About cellular system (2)

VECTOR MECHANICS FOR ENGINEERS: Vector Mechanics for Engineers: Dynamics. In the current chapter, you will study the motion of systems of particles.

Learning Bayesian belief networks

XII. Addition of many identical spins

Simulation Output Analysis

APPROXIMATE ANALYTIC WAVE FUNCTION METHOD IN ELECTRON ATOM SCATTERING CALCULATIONS. Budi Santoso

Conditional Convergence of Infinite Products

2.1.1 The Art of Estimation Examples of Estimators Properties of Estimators Deriving Estimators Interval Estimators

Special Instructions / Useful Data

VIII Dynamics of Systems of Particles

A DATA DRIVEN PARAMETER ESTIMATION FOR THE THREE- PARAMETER WEIBULL POPULATION FROM CENSORED SAMPLES

χ be any function of X and Y then

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Consumer theory. A. The preference ordering B. The feasible set C. The consumption decision. A. The preference ordering. Consumption bundle

Physics 11b Lecture #2. Electric Field Electric Flux Gauss s Law

EDEXCEL NATIONAL CERTIFICATE UNIT 28 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME 2- ALGEBRAIC TECHNIQUES TUTORIAL 1 - PROGRESSIONS

GREEN S FUNCTION FOR HEAT CONDUCTION PROBLEMS IN A MULTI-LAYERED HOLLOW CYLINDER

Iterative Algorithm for a Split Equilibrium Problem and Fixed Problem for Finite Asymptotically Nonexpansive Mappings in Hilbert Space

Module Title: Business Mathematics and Statistics 2

ENGI 3423 Simple Linear Regression Page 12-01

Tian Zheng Department of Statistics Columbia University

MATH Midterm Solutions

Lecture 3 : Concentration and Correlation

Phys 332 Electricity & Magnetism Day 13. This Time Using Multi-Pole Expansion some more; especially for continuous charge distributions.

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

COV. Violation of constant variance of ε i s but they are still independent. The error term (ε) is said to be heteroscedastic.

Overview. Review Superposition Solution. Review Superposition. Review x and y Swap. Review General Superposition

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow

FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-PELL, K-PELL-LUCAS AND MODIFIED K-PELL SEQUENCES

ENGI 4430 Numerical Integration Page 5-01

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

Best Linear Unbiased Estimators of the Three Parameter Gamma Distribution using doubly Type-II censoring

STA302/1001-Fall 2008 Midterm Test October 21, 2008

Lecture 6: October 16, 2017

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

RANDOM SYSTEMS WITH COMPLETE CONNECTIONS AND THE GAUSS PROBLEM FOR THE REGULAR CONTINUED FRACTIONS

A tighter lower bound on the circuit size of the hardest Boolean functions

L5 Polynomial / Spline Curves

Objectives. Learning Outcome. 7.1 Centre of Gravity (C.G.) 7. Statics. Determine the C.G of a lamina (Experimental method)

Lecture 8: Linear Regression

3. A Review of Some Existing AW (BT, CT) Algorithms

Integral Equation Methods. Jacob White. Thanks to Deepak Ramaswamy, Michal Rewienski, Xin Wang and Karen Veroy

A. Thicknesses and Densities

ENGI 4421 Propagation of Error Page 8-01

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1

LESSON 15: COMPOUND INTEREST

Lecture 11: Introduction to nonlinear optics I.

MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES

Decentralized Algorithms for Sequential Network Time Synchronization

Exponential Generating Functions - J. T. Butler

ˆ SSE SSE q SST R SST R q R R q R R q

PTAS for Bin-Packing

Chapter 7 Varying Probability Sampling

Problems and Solutions

Statistics MINITAB - Lab 5

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

d dt d d dt dt Also recall that by Taylor series, / 2 (enables use of sin instead of cos-see p.27 of A&F) dsin

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)

Introduction to local (nonparametric) density estimation. methods

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

ECE 595, Section 10 Numerical Simulations Lecture 19: FEM for Electronic Transport. Prof. Peter Bermel February 22, 2013

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r.

On a Problem of Littlewood

Numerical Solution of Non-equilibrium Hypersonic Flows of Diatomic Gases Using the Generalized Boltzmann Equation

Inequalities for Dual Orlicz Mixed Quermassintegrals.

Computational Geometry

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

Pushdown Automata (PDAs)

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

A Brief Guide to Recognizing and Coping With Failures of the Classical Regression Assumptions

Chapter 5 Force and Motion

ECON 482 / WH Hong The Simple Regression Model 1. Definition of the Simple Regression Model

Chapter 5 Force and Motion

Transcription:

Lectue 9 Multple Class Models Multclass MVA Appoxmate MVA 8.4.2002 Copyght Teemu Keola 2002 1

Aval Theoem fo Multple Classes Wth jobs the system, a job class avg to ay seve sees the seve as equlbum wth oe job (hmself!) emoved fom the system A () = ( - 1 ) = () ( 1, 2,..., R ) A (0, 0,...,0, 1, 0,..., 0) R job classes th job class 8.4.2002 Copyght Teemu Keola 2002 2

3 8.4.2002 Copyght Teemu Keola 2002 Multple Class MVA (4), (0) = 0 statg pot: + = devce delay D devce queueg D R A, )] ( [1 ) (,,, ', esdece tme R Z X system Lttle + = ) ( ) ( ', 0, (espose tme law) R X R X Lttle devce = = = ) ( ) (, ) ( ) ( ) ( ) ( ) (, ', 0,,,, A () = ( - 1 ) = () A +1

Multple Class Mea Value Aalyss (MVA) (2) Compute solutos though class populato space =( 1, 2,..., R ), (0,0) statg fom empty system (1,0) (0,1) populato (state) space (2,0) (1,1) (0,2) ca stll be lage! (3,0) (2,1) (1,2) (0,3) two job classes taget populato (1,3)? taget populato (3,1)? taget populato (6, 15, 300)? (3,1) (1,3) Alg 7.2 [LZGS 84] 8.4.2002 Copyght Teemu Keola 2002 4

Example (4) 2-class closed model, Fg. 7.2 [LZGS 84] Job classes A, B Tbl 7.3 [LZGS 84] (0,0) Q CPU, A = Q DISK, A = Q CPU, B = Q DISK, B = 0 (1,0) R CPU, A, R DISK, A, X 0, A, Q CPU, A, Q DISK, A (0,1) R CPU, B, R DISK, B, X 0, B, Q CPU, B, Q DISK, B (1,1) R CPU, A, R DISK, A, R CPU, B, R DISK, B, X 0, A, X 0, B, Q CPU, A, Q DISK, A, Q CPU, B, Q DISK, B 8.4.2002 Copyght Teemu Keola 2002 5

Aothe Smple Example Fg. 6.1 [Me 94] D, quey =1 update =2 cpu =1 0.105 0.375 Watch out fo dex odeg: D 1,2 = D 2, quey d1 =2 0.180 0.480 d3 =3 0 0.240 Populato book fgues ode (Update, Quey) 8.4.2002 Copyght Teemu Keola 2002 6

update quey Smple Example (5) (0,0) (1,0) ( 0) = 0= ( 1 ), A, X 01 10 1, (,) = ( 0105. + 0180. ) = 3509. 11, (,) 1 0 = 3509. * 0105. = 0. 368 (,) 10 = 3509. * 0180. = 0632. (,) 10 = 0 21, 31, ' R 12 (,) 10 =? (,) 10 = (,) 10 = (,) 10 = 0, [ ] ' ' ' R (,) 1 0 = D 1+ 0 = 0105. R (,) 1 0 = 0180. R (,) 1 0 = 0 11, 11, 21, 31, 12, 22, 32, (,) 10 = (,) 10 + (,) 10 = 0368. 1 11, 11, (,) 10 = 0632. (,) 10 = 0 2 3 8.4.2002 Copyght Teemu Keola 2002 Tbl 6.3 7

Smple Example (cotd) (6) (0,1): ( 01, ) = 0343. ( 01, ) = 0438. ( 01, ) = 0219. 1 2 3 devce (1,1): [ ] ' R (,) 11 = D 1+ A (,) 11 = D [ 1+ ( 01,)] 11, 11, 11, 11, 1 [ ] = 0105. 1+ 0. 343 = 0141. [ ] [ ] ' ' R (,) 11 = D 1+ ( 0,) 1 = 0180. 1+ 0. 438 = 0. 259 R 31 (,)= 11 0 21, 21, 2 X 01 11 1, (,) = 0141. + 0258. = 2. 500 dex ( ) class dex 11, 21, 31, (,) 11 = 2.* 5 0141. = 0. 352 (,) 11 = 2.* 5 0. 259 = 0. 648 (,) 11 = 0... 12, 22, 32, (,) 11 = 0. 334 (,) 11 = 0519. (,) 11 = 0156., total popul. (,) 11 = 0. 686 1 2 3 (,) 11 = 1158. (,) 11 = 0156. smlaly fo states (2,0), (3,0), (2,1), (3,1) Tbl 6.3 8.4.2002 Copyght Teemu Keola 2002 8

Smple Example (cotd) (slly ode, slly otato, soy!) Basele soluto Table 6.3 [Me 94] exteal: class update espose tme: 2.444 s teal: Dsk1 utlzato too hgh Modfcato: move quees to Dsk2 move quey demad fom Dsk 1 to Dsk2 D 21 = D d1,quey = 0, D 31 = D d2,quey = 0.180 solve aga class update espose tme: 1.934 s Table 6.4 [Me 94] Table 6.4 8.4.2002 Copyght Teemu Keola 2002 9

Poduct Fom Soluto Exsts: W s Aalytcally Solvable BCMP-etwoks Baskett, Chady, Mutz & Palacos (1975) Sevce dscple FCFS, PS, IS, LCFS-PR Job classes, class swtchg Sevce tme dstbutos, teaval tmes Expoetal teavals tmes fo FCFS seves o fo ope job class moe geec fo othes (atoal Laplace tasfomato exsts) Load-depedet seves (LD-seves) S = f( ) fo FCFS (I.e., same fo each class) S = f( ) fo othes 8.4.2002 Copyght Teemu Keola 2002 10

Poduct Fom Soluto Exsts? Job Flow balace flow = flow out pe devce, pe system Oe step behavo Devce homogeety sgle esouce possesso o blockg depedet job behavo local fomato fa sevce outg homogeety A B µ = f ( ) µ = f ( ) p k costat (pob fo class chage s load depedet) 8.4.2002 Copyght Teemu Keola 2002 11

8.4.2002 Copyght Teemu Keola 2002 12

How Useful ae Exact Soluto Methods? MVA & Covoluto based algothms Vey good fo sgle class cases Mght be too tme cosumg fo multple class cases f of classes o class populatos ae (vey) lage O( MVA ) = O( K R Π(1 + ) ) K R #ops 3 2 2 54 5 20 1 100M 20 5 1 3200 20 5 9 10M 8.4.2002 Copyght Teemu Keola 2002 13

Appoxmate MVA (1) Helps to solve MVA state space poblem Based o Schwetze-appoxmato: MVA empty system (0,0) (1,0) (0,1) (2,0) (1,1) (0,2) (2,1) (1,2) (3,1) stat hee () ---------- costat App. MVA (2,1) (3,1) (1,2) guess fst, teate 8.4.2002 Copyght Teemu Keola 2002 14

MVA vs Appoxmate MVA MVA (0,0,0,0,0) (1,0,0,0,0) (0,1,0,0,0) (0,0,1,0,0) (0,0,0,1,0) (0,0,0,0,1)... (2,2,4,4,5) (3,1,4,4,5) (3,2,3,4,5) (3,2,4,3,5) (3,2,4,4,4) App MVA (3,2,4,4,5) quess tal state std MVA step Schwetze app 8.4.2002 Copyght Teemu Keola 2002 15

16 8.4.2002 Copyght Teemu Keola 2002 Sgle Class Schwetze Appoxmato ) ( 1 1) ( 1 1) ( ) ( costat ) ( = =

epeat utl covegece Sgle Class Appoxmate MVA guess tal : compute : stdmva step : R' X 0 ( 1) = ( ) = ( ) = ( ) = X ( ) D 0 1 [ 1+ ( 1) ] ( Z + R' ( ) ) ( )* R' ( ) ( ) schwetze pop=9 pop=10 mva 8.4.2002 Copyght Teemu Keola 2002 17

Example (4) D = (10, 10, 15), K=3, =2 [Fg. 5.1] step 0 step 1 step 2 ( 2) = 2 / 3 = 0. 667 R1 D1 1 2 1 ' ' ' = + 1 10*. 1333 13. 333 R2 R3 15*. 1333 20 2 = = = = = 2 X 0 = = 0. 04286 46. 67 1 = 0. 5714 = 2 3 = 0. 8572 = 2 ( ) R1 10 1 0 5714 12 857 R2 R3 15 1 0 8572 '. ' '. = +. * 2 = = = + 2 2 X 0 = = 0. 042424 47143. 1 = 05454. = 2 3 = 0. 9092 = 2 why stop hee? ( ) 8.4.2002 Copyght Teemu Keola 2002 tal guess: eve dstbuto = 0.5455 exact 0.9090 exact 21429. 18

Questos (3) Q. How to quess tal job dstbuto A: ) = K ( (eve dstbuto o all devces) Q. Does t always covege? A. o. Almost always. o quaatee. Q. If t coveges, does t covege to the ght value? A. We hope so. It seems to do t. 8.4.2002 Copyght Teemu Keola 2002 19

Questos (cotd) Q. What s good measue of covegece? A. E.g., max elatve chage must be less tha 1% ( ) 8.4.2002 Copyght Teemu Keola 2002 20

Geeal Statoay Iteatve Method (1) (fom umecal Lea Algeba) = B+ c Fxed pot equato coveges fom abtay tal ( 0) f ρ( B) = max λ( B) <1 spectal adus of B th egevalue of B Q. Do we check ths befoe usg appoxmate MVA? A. o. 8.4.2002 Copyght Teemu Keola 2002 21

Geeal Theoy of Iteato (1) Thm: = f ( ) If = f ( ) has oot α { } ad f ( ) exsts close to α,.e., J = : α < ρ ad f ' ( ) < 1 J The (a) J each teato (b) coveges to α (c) α s the oly oot Q. Do we check ths fo appoxmate MVA? A. o. J 8.4.2002 Copyght Teemu Keola 2002 22

How Good s Appoxmate MVA Petty good fo thoughput ad espose tme ot so good fo queue legths at heavy loads Fgs 34.1-34.3 [Ja 91] 8.4.2002 Copyght Teemu Keola 2002 23

sgle class: Multple Class Schwetze Appoxmato (1) ( ) costat ( ) ( 1) = 1 multple class: ( ) costat 1 ( 1) = ( ) ( ) ( 1 ) = 1 1 ( 1 ) = ( ) 8.4.2002 Copyght Teemu Keola 2002 24

Multple Class Appoxmate MVA 1 ( 1 ) = ( ) (2,2,4,4,5) (3,1,4,4,5) (3,2,3,4,5) (3,2,4,3,5) (3,2,4,4,4) 2/3*... (3,2,4,4,5) 4/5*... 8.4.2002 Copyght Teemu Keola 2002 25

Multple Class Appoxmate MVA (1) guess tal () = /K at taget state (2) compute back (-1 ) = ( -1)/ () (3) use stadad MVA step to compute ew estmate of () teate steps (2) ad (3) utl covegece usually 4-6 teatos eough std output fom last teato 8.4.2002 Copyght Teemu Keola 2002 (dstbute evely to evey ode vsted) (2,1) (3,1) (1,2) Fg. 6.5 [Me 94] 26

Multple Class Appoxmate MVA Does t covege? Almost always. o quaatee. If t coveges, does t covege to the ght value? It seems to do good wok... What s good measue of covegece? e.g., max elatve chage () < 1% 8.4.2002 Copyght Teemu Keola 2002 27

Example (2) Model: Fg. 6.1 [Me 94] step 0 step 1 (,) 31 = 15. (,) 31 = 1/ 3= 0333. 11 12 (,) 31 = 15. (,) 31 = 0333. 21 22 (,) 31 = 0 (,) 31 = 0333. 31 32 [ ] ' R (,) 31 = D 1+ (,) 21 + (,) 30 Schwetze 0105 1 2 0 =. + 11( 31, ) + 12( 31, ) 0105. 1 2 15. 0 0210. 3 1 = + 3 + = R21 31 0180 1 2 ' 0 (,) =. + 21(,) 31 + 22(,) 3 1 0180. * 2 0. 360 3 1 = = R R 11 11 11 12 ' 31 ' 12 (,) 31 = 0 ' ' (,) 31 =... R (,) 31 =... R (,) 31 =... 22 32 Result: Tbl 6.6, Qsolve/1 output, PMVA output 8.4.2002 Copyght Teemu Keola 2002 =? 28

8.4.2002 Copyght Teemu Keola 2002 29

Poblems wth Aalytcal Solutos Load depedet seves Memoy Some pat of system ot poduct fom howeve, soluto method s obust Computatoal poblems accuacy, oveflow, udeflow Fgs 8.1, 8.3 [Me 94] 8.4.2002 Copyght Teemu Keola 2002 30

Commecal Soluto Packages (Softwae) BGS, Bosto, MA Best/1 AT&T, Holmdale, J Q+ SES, Aust, TX PAWS Uvesty Pojects Jeff Bumfeld, U of Aust, TX PMVA... 8.4.2002 Copyght Teemu Keola 2002 31

Pet ets vs. Queueg etwoks Petets good fo cocuecy Stochastc Pet ets (SP) Tmed Pet ets smulatos Queug etwoks good fo queug smple bouds Bottleeck Bouds (ABA) Balaced Job Bouds (BJB) exact soluto methods appoxmate soluto methods smulatos 8.4.2002 Copyght Teemu Keola 2002 32

Exact Soluto Methods fo Ope etwoks Queug etwoks Closed etwoks Covoluto MVA App. MVA 8.4.2002 Copyght Teemu Keola 2002 33

8.4.2002 Copyght Teemu Keola 2002 34