Published September 1981
| public
Journal Article
SCAT: A heuristic algorithm for queueing network models of computing systems
- Creators
- Neuse, D.
- Chandy, K.
Abstract
This paper presents a new algorithm for the approximate analysis of closed product-form queueing networks with fixed-rate, delay (infinite-server), and load-dependent 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
© 1981 ACM. This work was supported in part by NSF Grant MCS74-13302.Additional details
- Eprint ID
- 92223
- Resolver ID
- CaltechAUTHORS:20190111-144627224
- NSF
- MCS74-13302
- Created
-
2019-01-12Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field