The aggregate server method for analyzing serialization delays in computer systems
- 1 May 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 1 (2) , 116-143
- https://doi.org/10.1145/357360.357364
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.Keywords
This publication has 13 references indexed in Scilit:
- Modeling reentrant and nonreentrant softwareACM SIGMETRICS Performance Evaluation Review, 1982
- Performance Analysis of Suspend Locks in Operating SystemsIBM Journal of Research and Development, 1982
- LinearizerCommunications of the ACM, 1982
- Analyzing queueing networks with simultaneous resource possessionCommunications of the ACM, 1982
- A model of shared DASD and multipathingCommunications of the ACM, 1980
- Measuring and Calculating Queue Length DistributionsComputer, 1980
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- A model of a time sharing virtual memory system solved using equivalence and decomposition methodsActa Informatica, 1974
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- The structure of the “THE”-multiprogramming systemCommunications of the ACM, 1968