Approximate Models for Central Server Systems with Two Job Types.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA042684

Entities

People

  • Donald P. Gaver
  • John P. Lehoczky

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Air Force
  • Command And Control
  • Computational Science
  • Computers
  • Equations
  • Errors
  • Iterations
  • Markov Chains
  • Multiprogramming
  • New York
  • Numerical Analysis
  • Probability
  • Random Variables
  • Scientific Research
  • Steady State
  • Stochastic Processes

Readers

  • Computational Modeling and Simulation
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space