This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Priority Queueing Systems (M/G/1) Prof. John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong John C.S. Lui () Computer System Performance Evaluation 1 / 13 Outline Outline 1 Priority Systems Mean Value Analysis Conservation Law for M/G/1 Priority Systems John C.S. Lui () Computer System Performance Evaluation 2 / 13 Priority Systems Mean Value Analysis Priority Queueing System (for M/G/1 queue) There are P different classes ; indexed by subscript p with ( p = 1 , 2 , . . . , P ) . Define λ = P X p = 1 λ p and ¯ x = P X p = 1 λ p λ ¯ x p ρ p = λ p ¯ x p ρ = λ ¯ x = P X p = 1 λ p P X p = 1 λ p λ ¯ x p = λ 1 λ P X p = 1 λ p ¯ x p = P X p = 1 ρ p P [ Server idle ] = 1 P X i = 1 ρ i John C.S. Lui () Computer System Performance Evaluation 4 / 13 Priority Systems Mean Value Analysis Finding average waiting time Let W p = E[waiting time for jobs from class p]. T p = E[response time for jobs from class p] = W p + ¯ x p Waiting time: 1 Delay due to the job found in service upon his arrival; 2 Delay he experiences due to jobs he finds in the queue upon his...
View
Full
Document
This note was uploaded on 05/18/2010 for the course COMPUTER S CSC5420 taught by Professor Lui during the Spring '10 term at CUHK.
 Spring '10
 Lui
 Computer Science

Click to edit the document details