Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Asymptotics for M/G/1 low-priority waiting-time tail probabilities
Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory
Queueing Systems: Theory and Applications
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
Mathematics of Operations Research
Waiting Time Asymptotics in the Single Server Queue with Service in Random Order
Queueing Systems: Theory and Applications
Sojourn Times In The M/G/1 FB Queue With Light-Tailed Service Times
Probability in the Engineering and Informational Sciences
The Fluid Limit of an Overloaded Processor Sharing Queue
Mathematics of Operations Research
Limits and approximations for the M/G/1 LIFO waiting-time distribution
Operations Research Letters
The equivalence between processor sharing and service in random order
Operations Research Letters
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
Sojourn Time Tails In The M/D/1 Processor Sharing Queue
Probability in the Engineering and Informational Sciences
Sojourn times in (discrete) time shared systems and their continuous time limits
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Tail behavior of conditional sojourn times in Processor-Sharing queues
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review
The Fluid Limit of an Overloaded Processor Sharing Queue
Mathematics of Operations Research
Sojourn time asymptotics in Processor Sharing queues with varying service rate
Queueing Systems: Theory and Applications
The Foreground-Background queue: A survey
Performance Evaluation
Asymptotic properties of sojourn times in multiclass time-shared systems
Probability in the Engineering and Informational Sciences
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications
Tail-robust scheduling via limited processor sharing
Performance Evaluation
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Is Tail-Optimal Scheduling Possible?
Operations Research
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight into the way a large sojourn time occurs, enabling the construction of an (asymptotically efficient) importance sampling algorithm. Finally our results for PS are compared to a number of other service disciplines, such as FCFS, LCFS, and SRPT.