article · Communications of the ACM · 1975
Decomposability, instabilities, and saturation in multiprogramming systems
Cited by 140Open access
Abstract
A step-by-step approach to model the dynamic behavior and evaluate the performance of computing systems is proposed. It is based on a technique of variable aggregation and the concept of nearly decomposable systems, both borrowed from Econometrics. This approach is taken in order to identify in multiprogramming paging systems (i) unstable regimes of operations and (ii) critical computing loads which bring the system into states of saturation. This analysis leads to a more complete definition of the circumstances in which “thrashing” can set in.
Cite this paper
Courtois, P. (1975). Decomposability, instabilities, and saturation in multiprogramming systems. Communications of the ACM, 18(7), 371–377. https://doi.org/10.1145/360881.360887
Courtois, Pierre. “Decomposability, instabilities, and saturation in multiprogramming systems.” Communications of the ACM, vol. 18, no. 7, 1975, pp. 371–77, https://doi.org/10.1145/360881.360887.
Courtois, Pierre. 1975. “Decomposability, instabilities, and saturation in multiprogramming systems.” Communications of the ACM 18 (7): 371–77. https://doi.org/10.1145/360881.360887.
Courtois, P. (1975) ‘Decomposability, instabilities, and saturation in multiprogramming systems’, Communications of the ACM, 18(7), pp. 371–377. Available at: https://doi.org/10.1145/360881.360887.
@article{courtois1975decomposability,
title = {{Decomposability, instabilities, and saturation in multiprogramming systems}},
author = {Courtois, Pierre},
journal = {Communications of the ACM},
volume = {18},
number = {7},
pages = {371--377},
year = {1975},
doi = {10.1145/360881.360887}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.