Algorithmic Analysis of a Markovian Model for a System with Batch and Interactive Jobs.

Abstract

A computer system serving both batch and interactive jobs is modeled as a single server queue, with an infinite source of ordinary customers and a finite source of priority customers. The stability condition and the stationary probability distribution are determined. For a stable system, it is shown how the distribution and moments, of the waiting time, the sojourn time, the completion time, and the busy period, may be efficiently computed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1980
Accession Number
ADA086711

Entities

People

  • Guy Latouche
  • Jean Paul Colard

Organizations

  • University of Delaware

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Absorption
  • Air Force
  • Applied Mathematics
  • Computers
  • Differential Equations
  • Distribution Functions
  • Equations
  • Generators
  • Kolmogorov Equations
  • Markov Chains
  • Mathematics
  • Probability
  • Probability Distributions
  • Scientific Research
  • Security
  • Stability Conditions
  • Terminals

Fields of Study

  • Mathematics

Readers

  • Computer Science.
  • Mathematical Modeling and Probability Theory.