Equivalence and decomposition in queueing systems—A unified approach
- 1 August 1985
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 5 (3) , 175-186
- https://doi.org/10.1016/0166-5316(85)90011-2
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Computable Error Bounds for Aggregated Markov ChainsJournal of the ACM, 1983
- Models of DASD subsystems: Basic model of reconnectionPerformance Evaluation, 1981
- Exact Aggregation in Exponential Queueing NetworksJournal of the ACM, 1978
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- The VM/370 Performance PredictorACM Computing Surveys, 1978
- Decomposability, instabilities, and saturation in multiprogramming systemsCommunications of the ACM, 1975
- Error Analysis in Nearly-Completely Decomposable Stochastic SystemsEconometrica, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- A model of a time sharing virtual memory system solved using equivalence and decomposition methodsActa Informatica, 1974
- Jobshop-Like Queueing SystemsManagement Science, 1963