Decomposability, instabilities, and saturation in multiprogramming systems
Decomposability, instabilities, and saturation in multiprogramming systems
复制标题
多道程序设计系统中的可分解性、不稳定性和饱和性
DOI:
10.1145/360881.360887
复制
发表时间:
1975
期刊:
影响因子:
--
通讯作者:
P. Courtois
中科院分区:
文献类型:
--
作者:
P. Courtois
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.