Tail behavior of conditional sojourn times in Processor-Sharing queues
Queueing Systems: Theory and Applications
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
Sojourn time asymptotics in Processor Sharing queues with varying service rate
Queueing Systems: Theory and Applications
The Foreground-Background queue: A survey
Performance Evaluation
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fluid Limits for Shortest Remaining Processing Time Queues
Mathematics of Operations Research
Tail-robust scheduling via limited processor sharing
Performance Evaluation
Queueing Systems: Theory and Applications
Is Tail-Optimal Scheduling Possible?
Operations Research
| Hi-index | 0.00 |
We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its large-deviations decay rate. The value of this decay rate critically depends on whether there is mass in the endpoint of the service-time distribution or not. An auxiliary priority queue, for which we obtain some new results, plays an important role in our analysis. We apply our SRPT results to compare SRPT with FIFO from a large-deviations point of view.