バーチャル・メモリ方式の計算機のメモリ・ハイアラルキー
スポンサーリンク
概要
- 論文の詳細を見る
The performance of a timesharing system having paging mechanism was analyzed. From the data of paging pattern, it is found that the swapping probability is approximated by an exponential function of the number of pages which one task holds in main memory. On the basis of the above mentioned experimental results and the theory of cyclic queue applied to the time sharing system, the ratios of CPU idle time and operating system time are expressed by the following parameters; the capacity of the main memory, the paye swap time between two memories mentioned above, the number of running tasks and average execution time per instruction.
- 一般社団法人情報処理学会の論文
- 1973-10-15