Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1981 | public
Journal Article

SCAT: A heuristic algorithm for queueing network models of computing systems

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

Created:
August 19, 2023
Modified:
October 20, 2023