|
||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||
ABSTRACT
We consider an M/M/1 queueing system under the Shortest Remaining Processing Time (SRPT) policy. We show that there are constants cl and c2 such the average sojourn time under SRPT lies between cl (μ(1 - ρ) log 1/(1 - ρ))-1 and c2 (μ(l - ρ) log 1/(1 - ρ))-1, where μ denotes the service rate and ρ denotes the load. Comparing this with the classic result that any scheduling policy that does not use the knowledge of job sizes has average sojourn time (μ(1-ρ))-1, implies that SRPT offers a non-constant improvement over such policies. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
|
||||||||||||||||||||||||||||