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

Authors:
D. Neuse;K. Chandy
Affiliations:
The University of Texas, Austin;The University of Texas, Austin
Venue:
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1981

Citing 6
Cited 10

Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
The Distribution of Queuing Network States at Input and Output Instants

Journal of the ACM (JACM)
A model of shared DASD and multipathing

Communications of the ACM
Memory management and response time

Communications of the ACM
Some Extensions to Multiclass Queueing Network Analysis

Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
The approximate solution of large queueing network models

The approximate solution of large queueing network models

Bound hierarchies for multiple-class queuing networks

Journal of the ACM (JACM) - The MIT Press scientific computation series
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains

IEEE Transactions on Computers
SIQUEUE-PET: an environment for queueing network modelling

ACM SIGMETRICS Performance Evaluation Review
Multiclass queueing networks with population constrainted subnetworks

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Computational algorithms for state-dependent queueing networks

ACM Transactions on Computer Systems (TOCS)
Improved lineariser methods for queueing networks with queue dependent centres

SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On the predictive performance of queueing network models for large-scale distributed transaction processing systems

Information Technology and Management
Queueing networks

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
A fixed-point algorithm for closed queueing networks

EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Throughput analysis for order picking system with multiple pickers and aisle congestion considerations

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.