An Extension of a Model for Memory Partitioning in Multiprogrammed Virtual Memory Computer Systems

概要

論文の詳細を見る
The effect of CPU utilization of memory partitioning among N programs for multiprogramming systems is investigated in the case of a general queuing network. In the analysis, the behavior of each program is represented by the lifetime function having convex/concave shape with some restrictions. The network model and the lifetime function are generalized to include SPIRN's and GHANEM's models as special cases. The following generalized results are obtained: When the lifetime function has only convex region (is proportional to x^α, α>1),the optimal partition is to divide main memory equally among q of the N programs (q is the optimal degree of multiprogramming). When the lifetime function has the convex shape (is proportional to x^α, α>1)in the interval [O, m_0] and has the concave shape (is lipschitzian) in the interval [m_0, &prop;), we have the following statements on optimal memory partition: (i)if the total size m of main memory is greater than or equal to Nm_0, all programs have memory of size m/N; (ii)if m<Nm_0, there exists a memory size m_1 such that no program can have memory of size other than m_1 or m_0 or O.
一般社団法人情報処理学会の論文
1979-07-30