Degree of multiprogramming in page-on-demand systems
- 1 June 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (6) , 305-308
- https://doi.org/10.1145/363011.363026
Abstract
A simple stochastic model is described which offers a base for understanding the relationship between the number of programs permitted to share memory (the degree of multiprogramming), drum traffic rates, and central processing unit utilization in page-on-demand, multiprogrammed, time-shared computer systems. The model preserves, as a key feature, the property of page-demand statistics which implies a “burst” of page demands at the beginning of any job or quantum execution. The model, a Markov chain, is analyzed numerically and the results are presented graphically for a wide range of key environment-descriptive parameters. Implications of the results to time-shared system design and programming are discussed, and a calculation of the optimal degree of multiprogramming for a wide range of parameters is presented graphically.Keywords
This publication has 8 references indexed in Scilit:
- Further experimental data on the behavior of programs in a paging environmentCommunications of the ACM, 1968
- The working set model for program behaviorCommunications of the ACM, 1968
- Resource management for a medium scale time-sharing operating systemCommunications of the ACM, 1968
- Microprogamming under a page on demand strategyCommunications of the ACM, 1967
- The simulation of time sharing systemsCommunications of the ACM, 1967
- Probability Models for Multiprogramming Computer SystemsJournal of the ACM, 1967
- Dynamic program behavior under pagingPublished by Association for Computing Machinery (ACM) ,1966
- Program and Addressing Structure in a Time-Sharing EnvironmentJournal of the ACM, 1966