Approximate models for central server systems with two job types
By: by J.P. Lehoczky and D.P. Gaver
Contributors: Gaver, Donald Paul; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1977
Place of publication: Monterey, Calif
Language: eng
Number of pages: 24
Subjects: Production scheduling; Mathematical models; Approximation theory; Multiprogramming (Electronic computers); Queuing theory
Description: Two new approximation techniques for describing the performance of a closed queueing network when two or more job types are present are introduced and analyzed. The approximations apply in cases where a product form steady state solution can not be obtained, for example in the first-come-first served single server queue case. This approximation provides a method of reducing the state space to a small fraction of that needed for an implementation of the Gaver-Humfeld method. Numerical results illustrate the excellent accuracy of these techniques. (Author)
Notes: Title from cover.

"June 1977"--Cover.

"NPS-55-77-25"--Cover.

Author(s) subject terms: Performance evaluation, closed queueing network, state space reduction, phase-type distributions, approximate model.

Includes bibliographical references (p. 23-24).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1977.