IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i6p1212-1230.html
   My bibliography  Save this article

Approximate Queuing Models for Multiprogramming Computer Systems

Author

Listed:
  • B. Avi-Itzhak

    (Israel Institute of Technology, Haifa, Israel)

  • D. P. Heyman

    (Bell Telephone Laboratories, Holmdel, New Jersey)

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.

Suggested Citation

  • B. Avi-Itzhak & D. P. Heyman, 1973. "Approximate Queuing Models for Multiprogramming Computer Systems," Operations Research, INFORMS, vol. 21(6), pages 1212-1230, December.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:6:p:1212-1230
    DOI: 10.1287/opre.21.6.1212
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.6.1212
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.6.1212?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. B. Krishna Kumar & A. Thanikachalam & V. Kanakasabapathi & R. Rukmani, 2016. "Performance analysis of a multiprogramming–multiprocessor retrial queueing system with orderly reattempts," Annals of Operations Research, Springer, vol. 247(1), pages 319-364, December.
    2. Valeriy A. Naumov & Yuliya V. Gaidamaka & Konstantin E. Samouylov, 2019. "On Truncation of the Matrix-Geometric Stationary Distributions," Mathematics, MDPI, vol. 7(9), pages 1-10, September.
    3. Jing Jia & Sunderesh S. Heragu, 2009. "Solving Semi-Open Queuing Networks," Operations Research, INFORMS, vol. 57(2), pages 391-401, April.
    4. Sonja Otten & Ruslan Krenzler & Lin Xie & Hans Daduna & Karsten Kruse, 2022. "Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 603-648, June.
    5. Cree S. Dawson & Charles J. McCallum & R. Bradford Murphy & Eric Wolman, 2000. "Operations Research at Bell Laboratories through the 1970s: Part II," Operations Research, INFORMS, vol. 48(3), pages 351-361, June.
    6. Dhingra, Vibhuti & Kumawat, Govind Lal & Roy, Debjit & Koster, René de, 2018. "Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operations," European Journal of Operational Research, Elsevier, vol. 267(3), pages 855-876.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:21:y:1973:i:6:p:1212-1230. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.