Models for parallel processing within programs
- 1 October 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (10) , 821-831
- https://doi.org/10.1145/359619.359622
Abstract
Approximate queueing models for internal parallel processing by individual programs in a multiprogrammed system are developed in this paper. The solution technique is developed by network decomposition. The models are formulated in terms of CPU:I/O and I/O:I/O overlap and applied to the analysis of these problems. The percentage performance improvement from CPU:I/O overlap is found to be greatest for systems which are in approximate CPU:I/O utilization balance and for low degrees of multiprogramming. The percentage improvement from I/O:I/O overlap is found to be greatest for systems in which the I/O system is more utilized than the CPU.Keywords
This publication has 9 references indexed in Scilit:
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Memory management and response timeCommunications of the ACM, 1977
- Validation of a queueing model with classes of customersPublished by Association for Computing Machinery (ACM) ,1976
- Solution of Queuing Problems by a Recursive TechniqueIBM Journal of Research and Development, 1975
- Approximate Analysis of Central Server ModelsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Studies in Markov models of computer systemsPublished by Association for Computing Machinery (ACM) ,1975
- The Effect on Throughput of Multiprocessing in a Multiprogramming EnvironmentIEEE Transactions on Computers, 1973
- Renewal Theory and its RamificationsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1958