Published February 1982 | Version public
Journal Article

Linearizer: a heuristic algorithm for queueing network models of computing systems

  • 1. ROR icon The University of Texas at Austin

Abstract

A new algorithm is presented for the approximate analysis of closed, product-form queueing networks with single-server and delay (infinite-server) queues. This algorithm has the accuracy, speed, small memory requirements, and simplicity necessary for inclusion in a general network analysis package. The algorithm allows networks with large numbers of queues, job classes, and populations to be analyzed interactively even on microcomputers with very limited memory.

Additional Information

© 1982 ACM. Received 9/80; revised 1/81; accepted 6/81. This work was supported in part by the National Science Foundation under Grant MCS74-13302.

Additional details

Identifiers

Eprint ID
92250
Resolver ID
CaltechAUTHORS:20190114-104059640

Funding

NSF
MCS74-13302

Dates

Created
2019-01-14
Created from EPrint's datestamp field
Updated
2021-11-16
Created from EPrint's last_modified field