On the average sojourn time under M/M/1/SRPT

Authors:
Nikhil Bansal
Affiliations:
IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
Venue:
Operations Research Letters
Year:
2005

Citing 0
Cited 8

Nearly insensitive bounds on SMART scheduling

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the effect of inexact size information in size based policies

ACM SIGMETRICS Performance Evaluation Review
Competitive online scheduling for server systems

ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling despite inexact job-size information

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The effect of local scheduling in load balancing designs

ACM SIGMETRICS Performance Evaluation Review
The average response time in a heavy-traffic srpt queue

ACM SIGMETRICS Performance Evaluation Review
An embedded gateway based on real-time database

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study an M/M/1 queueing system under the shortest remaining processing time (SRPT) policy. We show that the average sojourn time varies as @Q((@m(1-@r)ln(e/(1-@r)))^-^1), where @r is the system load. Thus, SRPT offers a @Q(ln(e/(1-@r))) factor improvement over policies that ignore knowledge of job sizes while scheduling.