Steady state approximations of limited processor sharing queues in heavy traffic
Queueing Systems: Theory and Applications
Law of Large Number Limits of Limited Processor-Sharing Queues
Mathematics of Operations Research
Dynamics of New Product Introduction in Closed Rental Systems
Operations Research
Population effects in multiclass processor sharing queues
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Fixed-point approximations of bandwidth sharing networks with rate constraints
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
A Markovian event-based framework for stochastic spiking neural networks
Journal of Computational Neuroscience
Fluid models of many-server queues with abandonment
Queueing Systems: Theory and Applications
Dynamic fluid-based scheduling in a multi-class abandonment queue
Performance Evaluation
On queues with impatience: stability, and the optimality of Earliest Deadline First
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We investigate a processor-sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue or renege before completing service. The random time representing a job's patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable steady state behavior is presented. This fluid model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor-sharing queues.