Skip方式 Scheduling Algorithm

概要

論文の詳細を見る
A round-robin procedure is well-known as a descipline for assigning processor time to many jobs in a time-shared computer system. But this procedure lacks in flexibility. In this paper, a more flexible one named skip procedure, which is a slight extension of round-robin and is easily implemented, is introduced and analyzed. In a round-robin system a job is served at its every cycle, but in this skip system a job may or may not be served at its cycle according to its past history.
一般社団法人情報処理学会の論文
1968-09-15