Абстрактный

A MARKOV CHAIN MODEL FOR ROUND ROBIN SCHEDULING IN OPERATING SYSTEM

Deepak Sisodia, Dr. Sohan Garg

In the Round-Robin scheduling scheme, the scheduler processes each job, one after another, after giving a preset quantum of time. In the first-in first out (FIFO) scheduling, next process gets the opportunity only if the earlier arrived job is completely processed. This paper presents a general class of round-robin scheduling scheme in which both the above scheduling procedures are covered like particular cases. This class has many other scheduling schemes also. A Markov chain model is used to compare several scheduling schemes of the class. One scheduling scheme, which is a mixture of FIFO and round robin, is found efficient in terms of model based study approach. The system simulation procedure is used to derive the conclusion of the content.