Affiliation:
1. McMaster University
2. University of Virginia
3. California State University, San Marcos
Abstract
We consider a single server queue with renewal arrivals and i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. We provide a fluid model (or formal law of large numbers approximation) for this system. The foremost payoff of our fluid model is a fluid level approximation for the state-dependent response time of a job of arbitrary size, that is, the amount of time it spends in the system, given an arbitrary system configuration at the time of its arrival.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference5 articles.
1. Analysis of SRPT scheduling
2. D.G. Down H.C. Gromoll and A.L. Puha. Fluid limits for shortest remaining processing time queues. Mathematics of Operations Research forthcoming. 10.1287/moor.1090.0409 D.G. Down H.C. Gromoll and A.L. Puha. Fluid limits for shortest remaining processing time queues. Mathematics of Operations Research forthcoming. 10.1287/moor.1090.0409
3. Preventing Large Sojourn Times Using SMART Scheduling
4. Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
5. The QueueM/G/1 with the Shortest Remaining Processing Time Discipline
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献