The aggregate server method for analyzing serialization delays in computer systems

Authors:
Subhash C. Agrawal;Jeffrey P. Buzen
Affiliations:
Purdue University, West Lafayette, In.;One University Office Park, Waltham, Ma
Venue:
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1982

Citing 3
Cited 3

Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)
Balanced job bound analysis of queueing networks

Communications of the ACM

Modeling distributed file systems

ACM SIGMETRICS Performance Evaluation Review
A survey of techniques for the modeling of serialization delays in computer systems

ACM SIGMETRICS Performance Evaluation Review
Modelling parallel access to shared resources in a distributed file system using queueing networks

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

The aggregate server method is an approximate, iterative technique for analyzing the delays programs encounter while waiting for entry into critical sections, non-reentrant subroutines, and similar software structures that cause processing to become serialized. The method employs a conventional product form queueing network comprised of servers that represent actual I/O devices and processors, plus additional aggregate servers that represent serialized processing activity. The parameters of the product form network are adjusted iteratively to account for contention among serialized and non-serialized customers at each physical device.