Approximate analytic models of arbiters

  • Authors:
  • Patricia Jacobson

  • Affiliations:
  • Department of Computer Science, FR-35, University of Washington, Seattle, Washington

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Results at very light and very heavy loads are easy to obtain, but at intermediate loads performance modelling is necessary. Because of the considerable cost of simulation, we develope queueing network models which can be solved quickly by approximate analytic techniques. These models are validated by comparing with simulations at certain points, and then used to get a wide range of results quickly.