Fluid limits for shortest remaining processing time queues

Mathematics of Operations Research

Volumn 34, Issue 4, 2009, Pages 880-911

  Down, Douglas G ^a   Gromoll, H Christian ^b   Puha, Amber L ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b University of Virginia   (United States)

^c CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Fluid limit; Fluid model; Measure valued process; Response time; Shortest remaining processing time

Indexed keywords

ARRIVAL RATES; DESCRIPTORS; EXISTENCE AND UNIQUENESS; FIRST-ORDER APPROXIMATIONS; FLUID LIMITS; FLUID MODELS; INITIAL CONDITIONS; LAW OF LARGE NUMBERS; MEASURE-VALUED PROCESS; RENEWAL ARRIVAL; RESPONSE TIME; SCALING LIMITS; SERVICE TIME; SERVICE TIME DISTRIBUTION; SHORTEST REMAINING PROCESSING TIME; SINGLE SERVER QUEUE;

FLUIDS; PLASMA FLOW; PLASMAS; QUEUEING THEORY;

STOCHASTIC MODELS;

EID: 73249139458     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0409     Document Type: Article

References (21)

1. Bansal, N., M. Harchol-Balter. 2001. Analysis of SRPT scheduling: Investigating unfairness. Proc. 2001 ACM Sigmetrics Internat. Conf. Measurement Modeling Comput. Systems, SIGMETRICS, Cambridge, MA.
2. Billingsley, P. 1968. Convergence of Probability Measures. John Wiley & Sons, Inc., New York.
3. Down, D. G., R. Wu. 2006. Multi-layered round robin routing for parallel servers. Queueing Systems 53 177-188.
4. Down, D., H. C. Gromoll, A. L. Puha. 2009. State-dependent response times via fluid limits for shortest remaining processing time queues. ACM Sigmetrics Performance Evaluation Review (poster session). Forthcoming.
5. Doytchinov, B., J. L. Lehoczky, S. E. Shreve. 2001. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11 332-378.
6. Ethier, S., T. Kurtz. 1986. Markov Processes: Characterization and Convergence. John Wiley & Sons, Inc., New York.
7. Gromoll, H. C., R. J. Williams. 2009. Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19 243-280.
8. Gromoll, H. C., A. L. Puha, R. J. Williams. 2002. The fluid limit for a processor sharing queue. Ann. Appl. Probab. 12 797-859.
9. Kallenberg, O. 1986. RandomMeasures. Academic Press, New York.
10. Kruk, ŁL., J. L. Lehoczky, S. E. Shreve, S. N. Yeung. 2004. Earliest-deadline-first service in heavy traffic acyclic networks. Ann. Appl. Probab. 14 1306-1352.
11. Núñez Queija, R. 2002. Queues with equally heavy sojourn time and service requirement distributions. Ann. Oper. Res. 113 101-117.
12. Nuyens, M., B. Zwart. 2006. A large deviations analysis of the GI/GI/1 SRPT queue. Queueing Systems 54 85-97.
13. Perera, R. 1993. The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv Elektronik Übertragung-stechnik 47 110-114.
14. Prohorov, Yu. V. 1956. Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
15. Puha, A. L., A. L. Stoylar, R. J. Williams. 2006. The fluid limit of an overloaded processor sharing queue. Math. Oper. Res. 31 316-350.
16. Schassberger, R. 1990. The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time. Adv. Appl. Probab. 22 456-479.
17. Schrage, L. 1968. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16 687-690.
18. Schrage, L. E., L. W. Miller. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14 670-684.
19. Schreiber, F. 1993. Properties and applications of the optimal queueing strategy SRPT: A survey. Archiv Elektronik Übertragungstechnik 47 372-378.
20. Smith, D. R. 1976. A new proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 26 197-199.
21. Wierman, A., M. Harchol-Balter. 2003. Classifying scheduling policies with respect to unfairness in an M/G/1. Proc. 2003 ACM Sigmetrics Internat. Conf. Measurement Modeling Comput. Systems, SIGMETRICS, New York.