Publication | Open Access
Fluid Limits for Processor-Sharing Queues with Impatience
60
Citations
24
References
2008
Year
EngineeringComputer ArchitectureQueueing TheoryOperations ResearchProcessor-sharing QueueRenewal ArrivalsSystems EngineeringParallel ComputingQuantitative ManagementFluid LimitsJob SchedulerComputer EngineeringScheduling (Computing)Computer ScienceProbability TheoryQueueing SystemsCloud ComputingPerformance ModelingProcessor-sharing QueuesParallel ProgrammingFluid Queue
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1