Simultaneous resource possession in queueing models of computers
- 1 April 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 7 (1-2), 41-52
- https://doi.org/10.1145/1041766.1041771
Abstract
Neglect of simultaneous resource possession is a significant problem with queueing network models of computers. This is illustrated by examples of memory contention and channel contention with position sensing I/O devices. A class of extended queueing networks is defined to allow representation of simulataneous resource possession. Extended queueing network models of memory contention and channel contention are given. Solution techniques and numerical results for these models are discussed.Keywords
This publication has 10 references indexed in Scilit:
- Petri NetsACM Computing Surveys, 1977
- Memory management and response timeCommunications of the ACM, 1977
- Introduction to Regenerative SimulationIBM Journal of Research and Development, 1975
- A Straightforward Model for Computer Performance PredictionACM Computing Surveys, 1975
- I/O subsystem architectureProceedings of the IEEE, 1975
- Hierarchical techniques for the development of realistic models of complex computer systemsProceedings of the IEEE, 1975
- Approximate Analysis of Central Server ModelsIBM Journal of Research and Development, 1975
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- A Proof for the Queuing Formula: L = λWOperations Research, 1961