A perturbation method for solving some queues with processor sharing discipline
- 1 March 1989
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 26 (01) , 209-214
- https://doi.org/10.1017/s0021900200041966
Abstract
In this paper, we present a perturbation method of solving a second-order difference equation with variable coefficients with some additional assumptions. This method can be used to devise an algorithmic solution for the moments of sojourn times in some processor sharing queues. In particular, we examine three queues. The first has exponential service and a fairly general interrupted arrival mechanism. The second is a cyclic queue. The third is a model for a computer system in which finite and infinite sources interact.Keywords
This publication has 7 references indexed in Scilit:
- Response time distribution in a multiprogrammed computer with terminal trafficPerformance Evaluation, 1988
- Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual MemoryOperations Research, 1986
- A Conditional Response Time of the M/M/1 Processor-Sharing QueueAT&T Technical Journal, 1985
- The sojourn-time distribution in the M/G/1 queue by processor sharingJournal of Applied Probability, 1984
- A new approach to the M/G/1 processor-sharing queueAdvances in Applied Probability, 1984
- The cyclic queue with one general and one exponential serverAdvances in Applied Probability, 1983
- Waiting Time Distributions for Processor-Sharing SystemsJournal of the ACM, 1970