Abstract
A simple MP system consisting of an input-output facility and a central processor is modeled as a two-parameter Markov chain. The conditions for stability are demonstrated, and the steady-state joint probabilities are calculated explicitly. Various priority and capacity assignments result in radically different analytical situations, some of which have been considered in the literature. The present work treats a version that was considered for a time intractable. This paper emphasizes the analytical properties of the probability-generating functions and a method to solve a resultant functional equation. The numerical results display the importance of dependence between variables in the model.
Similar content being viewed by others
References
I. Adiri, M. Hofri, and M. Yadin, “A multiprogramming queue”,J. ACM 20:589–604 (1973).
Robert B. Ash,Complex Variables (Academic Press, New York, 1970).
C. Carathéodory,Theory of Functions of a Complex Variable, 2nd. ed., Vol.I (Chelsea, New York, 1958).
J. W. Cohen,The Single Server Queue (North-Holland Publishing Company, 1969).
B. A. Fuks,Theory of Analytic Functions of Several Complex Variables, AMS Mathematical Monograph, No. 8 (1963).
M. Hofri and M. Yadin, “Queueing Models of Multiprogramming Computer Systems: An Approach,” Operations Research, Statistics and Economies Mimeograph Series, No. 103, Faculty of Industrial and Management Engineering, Technion-IIT, Haifa, Israel (1972).
J. F. C. Kingman, “Two similar queues in parallel,”Ann. Math. Stat. 32:1314–1323 (1961).
Additional information
Technical Report No. 83, TECHNION—Israel Institute of Technology, Computer Science Department (August 1976).
Rights and permissions
About this article
Cite this article
Hofri, M. A generating-function analysis of multiprogramming queues. International Journal of Computer and Information Sciences 7, 121–155 (1978). https://doi.org/10.1007/BF00975883
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00975883