Abstract
The doubly stochastic server is a time-sharing model of slightly greater versatility than any comparable model that has been analysed previously.
The stationary distribution of its state is presented along with a necessary and sufficient condition of existence. Moreover, the conditional average response time of a job, given its requested processing time, is derived, and the stochastic law of the output stream is determined. The results are of a simple and useful form.
Zusammenfassung
Es wird ein Modell eines einzelnen Bedieners vorgestellt und unter der Annahme einer diskreten Zeitskala untersucht. Die betrachteten Bedienungsdisziplinen enthalten solche, die für den time-sharing Betrieb von Rechenanlagen interessant sind, wie etwa eine round-robin Disziplin.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baskett, F. et al.: Open, closed, and mixed networks of queues with different classes of customers. J.A.C.M.22, 1975, 248–260.
Daduna, H., andR. Schassberger: A discrete time round-robin queue with Bernoulli input and general arithmetic service time distributions. Acta Informatica15, 1981, 251–263.
Kelly, F.P.: Networks of queues. Adv. Appl. Prob.8, 1976, 416–432.
-: Reversibility and stochastic networks. New York 1979.
Schassberger, R.: On the response time distribution in a round-robin queue. Acta Informatica16, 1981, 57–62.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schassberger, R. The doubly stochastic server: A time-sharing model. Zeitschrift für Operations Research 25, 179–189 (1981). https://doi.org/10.1007/BF01917171
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01917171