On Approximate Computer System Models

  • Authors:
  • Erol Gelenbe

  • Affiliations:
  • Chaire d'Informatique de l'Université de Liège, Av des Tilleuls 59, Liège, Belgium and Institut de Recherche d'Informatique et d'Automatique, Rocquencourt, France

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new treatment of the boundary conditions of diffusionapproximations for interconnected queueing systems is presented.The results have applications to the study of the performance ofmultiple-resource computer systems. In this approximation method,additional equations to represent the behavior of the queues whenthey are empty are introduced. This reduces the dependence of themodel on heavy traffic assumptions and yields certain results whichwould be expected from queueing or renewal theory. The accuracy ofthe approach is evaluated by comparison with certain known exact ornumerical results.