Affiliation:
1. Univ. of Illinois, Chicago
Abstract
We consider a processor shared M/M/1 queue that can accommodate at most a finite number
K
of customers. Using singular perturbation techniques, we construct asymptotic approximations to the distribution of a customer's sojourn time. We assume that
K
is large and treat several different cases of the model parameters and also treat different time scales. Extensive numerical comparisons are used to back up our asymptotic formulas.—
Author's Abstract
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference17 articles.
1. ~BENDER C. M. AND ORSZAG S A. Adt'anced Mathematical Methods for Sczenttsts and ~ Enguzeers. McGraw-Hall New York 1978. ~BENDER C. M. AND ORSZAG S A. Adt'anced Mathematical Methods for Sczenttsts and ~ Enguzeers. McGraw-Hall New York 1978.
2. Waiting Time Distributions for Processor-Sharing Systems
3. Processor-Shared Time-Sharing Models in Heavy Traffic
4. ~KEVORKIAN J. AND COLE J. D. Perturbation 3 tethods m Apphed M thematics. Springer- ~Verlag New York 1981. ~KEVORKIAN J. AND COLE J. D. Perturbation 3 tethods m Apphed M thematics. Springer- ~Verlag New York 1981.
5. On Finite Capacity Processor-Shared Queues
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献