Published February 1982
| public
Journal Article
Linearizer: a heuristic algorithm for queueing network models of computing systems
- Creators
- Chandy, K. Mani
- Neuse, Doug
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
- Eprint ID
- 92250
- Resolver ID
- CaltechAUTHORS:20190114-104059640
- MCS74-13302
- NSF
- Created
-
2019-01-14Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field