Approximate Queuing Models for Multiprogramming Computer Systems

B. Avi-Itzhak and D. P. Heyman
Additional contact information
B. Avi-Itzhak: Israel Institute of Technology, Haifa, Israel
D. P. Heyman: Bell Telephone Laboratories, Holmdel, New Jersey

Operations Research, 1973, vol. 21, issue 6, 1212-1230

Abstract: In a multiprogramming computer system several jobs may be handled simultaneously by utilizing the central processing unit in processing one job while other jobs are being served by the peripheral devices. Our analysis of such a computer system proceeds in the following way. First we view the system as a closed queuing network with a fixed number of jobs, and obtain exact results for customer cycle times and server utilization. Then we use these results to develop an approximate model for the open system where the computer is fed by randomly arriving jobs. For the approximate model we obtain simple closed-form expressions for the delay distribution. The approximate model is then tested by comparing its result for the expected sojourn time to the exact results that we obtain for some special cases.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1212 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:6:p:1212-1230

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().