Abstract
The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference8 articles.
1. Some results of analyzing a probabilistic model of remote processing systems;Yashkov;Automat. Control and Computer Sci.,1981
2. Distribution of the conditional sojourn time in a system with division of time of servicing;Kitayev;Engineering Cybernetics,1978
3. Waiting Time Distributions for Processor-Sharing Systems
4. A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献