The MVA Pre-empt resume priority approximation

  • Authors:

  • Raymond M. Bryant;Anthony E. Krzesinski;Peter Teunissen

  • Affiliations:

  • IBM Thomas J. Watson Research Center, P. O. Box 218, Yorktown Heights, New York;Institute for Applied Computer Science, University of Stellenbosch, 7600 SteUenbosch, South Africa;Institute for Applied Computer Science, University of Stellenbosch, 7600 Stellenbosch, South Africa

  • Venue:
  • SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed multiclass queueing networks containing non pre-emptive Head Of Line (HOL) and Pre-empt Resume (PR) priority centers. The approximation has the same storage and computational requirements as MVA thus allowing computationally efficient solutions of large priority queueing networks. The accuracy of the MVA PR approximation is systematically investigated and presented in terms of error contour diagrams. The contour diagrams reveal that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is also compared to Sevcik's shadow approximation and another MVA approximation recently proposed by Chandy and Lakshmi.