動的再配置の解析と最適システムの設計

概要

論文の詳細を見る
In this paper a prombilistic model is presented for multiprogramming/multiprocessing computer system is with Enite memory space. The model consists of a first-in-first-served queue of which the length is kept fixed or infinite all the tixne and a service system which comprises some processors and a memory space of finite capacity.As many tasks as possible are loaded onto the memory space,and are Processed by the processors.We hypothesize that (i)the time to process a task is subject to the exponential distribution with parameter um,where m is the degree of multiprogramming,i.e.the number of tasks on the memory space;(ii)the amount of single space allocated to a task is subject to an arbitrary given probability distribution;(iii)whenever new tasks are loaded,the memory space is repacked,and the overhead,i.e.the time needed for it is negligible.We analytically investigate some stationary characteristics of the model such as the probability distribution of the degree of Multiprogramming,the expectation for it,te prombility distributions of the utilizations of the processors and memory space,the expectations for them,and so on.And further,on the basis of these results which we obtained,some design criteria for optimal multiprocessor systems and memory protection mechanism are presented.
一般社団法人情報処理学会の論文
1975-05-15