Summary
The queueing theory is applied to analyse a model of a multiprogramming operating system in which preemptive priorities are used for scheduling the service of concurrent streams of requests. Preemptions are permitted at the end of each service quantum. Mean waiting times and higher statistical moments in the M/G/1 system analysed are computed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babad, J.M.: A generalized multi-entrance time-sharing priority queue. J. ACM 22, 231–247 (1975)
Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 248–260 (1975)
Cobham, A.: Priority assignment in waiting line problems. Oper. Res. 2, 70–76 (1954)
Conway, R.W., Maxwell, W.L., Miller, J.W.: Theory of scheduling. Reading, MA: Addison Wesley 1967
Gelenbe, E., Muntz, R.R.: Probabilistic models of computer systems, I. Acta Inf. 7, 35–60 (1976)
Gelenbe, E.: Probabilistic models of computer systems, II: Diffusion approximations, waiting times and batch arrivals. Acta Inf. 12, 285–303 (1979)
Kesten, H., Runnenberg, J.Th.: Priority in waiting-line problems, I and II. Nederlandse Akademie van Wetenschappen, Amsterdam, Proc. Ser. A 60, 312–336 (1957)
Kleinrock, L.: Queueing systems. Vol. I, Appendix I. New York: John Wiley 1975
Klimov, G.P.: Queueing systems. Warszawa: WNT 1979
Simon, B.: Priority queues with feedback. J. ACM 31, 134–149 (1984)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rembowski, B. A priority queue with interruptions of service permitted after a time quantum. Acta Informatica 22, 241–251 (1985). https://doi.org/10.1007/BF00265681
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265681