Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

Authors:
P. Jelenkovic;P. Momcilovic
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
2003

Citing 0
Cited 15

Reduced Load Equivalence under Subexponentiality

Queueing Systems: Theory and Applications
Reduced-Load Equivalence for Queues with Gaussian Input

Queueing Systems: Theory and Applications
Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements

Performance Evaluation - Long range dependence and heavy tail distributions
Large deviations of sojourn times in processor sharing queues

Queueing Systems: Theory and Applications
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
Tail equivalence for some time-shared systems

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
Tails in scheduling

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
Processor sharing: A survey of the mathematical theory

Automation and Remote Control
Is fair resource sharing responsible for spreading long delays?

ACM SIGMETRICS Performance Evaluation Review
Uniform approximations for the M/G/1 queue with subexponential processing times

Queueing Systems: Theory and Applications
Delay tails in MapReduce scheduling

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the distribution of the waiting timeV in a stable M/G/1 processor-sharing queue with traffic intensityp x] = P[ B (1 -p) x](1 +o(1)) as x ? 8. Furthermore, we demonstrate that the preceding relationship does not hold if the service distribution has a lighter tail thane-vx.