利用者の多い計算センターにおける最適多重処理について
スポンサーリンク
概要
- 論文の詳細を見る
Suppose that, under a multiprogramming environment of multiplicity N, we divide the main memory space of capacity C of a cumputer system into N domains such as that N=Σ^^n__<i=1>p_i, C=Σ^^n__<i=1>p_iu_i and α(=u_0)≤u_1≤u_2≤...≤u_n; so that, on domains of capacity u_i, only jobs requiring a memory space of capacity v such that u_<i-1>≤v≤u_i are performed. Under a uniprogramming environment, jobs such that u_n≤v≤C are performed. The problem is, subject to the avove mentioned constraints, to minimize the time needed to perform all the jobs which arrive at a computation center within a certain definite period. In this paper, we consider some dundamental aspects of the problem, and show an analytical method and an efficient algorithm of calculation to obtain the optimal policy to divide the main memory into domains.
- 一般社団法人情報処理学会の論文
- 1974-08-15