Processor Utilization in Multiprogramming Systems via Diffusion Approximations

Donald P. Gaver and Gerald S. Shedler
Additional contact information
Donald P. Gaver: Naval Postgraduate School, Monterey, California
Gerald S. Shedler: IBM Research Laboratory, San Jose, California

Operations Research, 1973, vol. 21, issue 2, 569-576

Abstract: Cyclic queuing systems have been proposed by several authors in the study of the behavior of multiprogrammed computer systems. Programs in the system wait for service at the central processor unit (CPU); then, after page fault or input-output request at a data transmission unit (DTU), the process repeats until the program completes. Semi-Markov analysis of such systems, based on the apparently plausible assumption of independently but exponentially distributed CPU burst time, and independent, but nearly constant DTU tune may be conducted. This paper presents some very simple approximations based on a continuous-state approximation—the simple diffusion with two reflecting barriers—to describe the CPU utilization. Computational experience from which the quality of the approximations can be assessed is reported.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.2.569 (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:2:p:569-576

Access Statistics for this article

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