Asymptotic analysis of the waiting-time distribution for a large closed processor-sharing system
SIAM Journal on Applied Mathematics
Processor-shared time-sharing models in heavy traffic
SIAM Journal on Computing
SIAM Journal on Applied Mathematics
SIAM Journal on Applied Mathematics
On finite capacity processor-shared queues
SIAM Journal on Applied Mathematics
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
The Distribution of Queuing Network States at Input and Output Instants
Journal of the ACM (JACM)
On sojourn times in the finite capacity M/M/1 queue with processor sharing
Operations Research Letters
| Hi-index | 0.00 |
We consider a processor shared M/M/1 queue that can accommodate atmost a finite number K of customers. Using singular perturbation techniques,we construct asymptotic approximations to the distribution of acustomer's sojourn time. We assume that K is large and treat several different cases of themodel parameters and also treat different time scales. Extensivenumerical comparisons are used to back up our asymptotic formulas.—Author's Abstract