オンデマンド・ページング・システム動作解析のためのアドレス・パターン・ジェネレータ

概要

論文の詳細を見る
An address pattern generator based on a new concept called a two stack model is proposed in this paper. Paging behavior of the an address pattern generated by this generator is compared with that of an example of the actual address pattern and its usability is indicated. To show the effectiveness of the generator, paging behavior simulation of a multiprogrammed on-demand paging system is performed using the address pattern generator. The main emphasis is put on the comparison of various scheduling algorithm . It is shown that to give the equal CPU time to each program in a multiprogramming mix, memory allocation rather than slicing plays a key role. Associated overhead to accomplish the above goal is also described.
一般社団法人情報処理学会の論文
1975-08-15