A Time-Sharing Queue with a Finite Number of Customers
- 1 April 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 16 (2) , 315-323
- https://doi.org/10.1145/321510.321523
Abstract
A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations.Keywords
This publication has 2 references indexed in Scilit:
- Time-Shared Computer Operations With Both Interarrival and Service Times ExponentialJournal of the ACM, 1966
- On time losses in machinery undergoing interruptionsPhysica, 1943