On the asymptotic behavior of time-sharing systems
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 25 (10), 707-714
- https://doi.org/10.1145/358656.358666
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A Study of time sharing systems considered as queueing networks of exponential serversThe Computer Journal, 1980
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- A generating function approach to queueing network analysis of multiprogrammed computersNetworks, 1976
- 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
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963