International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme


Affiliations
1 Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), India
2 Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), India
3 Indira Gandhi Engineering College, Sagar, India
 

In the literature of Round-Robin scheduling scheme, each job is processed, one after the another after giving a fix quantum. In case of First-come first-served, each process is executed, if the previously arrived processed is completed. Both these scheduling schemes are used in this paper as its special cases. A Markov chain model is used to compare several scheduling schemes of the class. An index measure is defined to compare the model based efficiency of different scheduling schemes. One scheduling scheme which is the mixture of FIFO and round robin is found efficient in terms of model based study. The system simulation procedure is used to derive the conclusion of the content.

Keywords

Process Scheduling, Markov Chain Model, State of System, Deadlock State, Process Queue, First-In First-Out (FIFO), Round-Robin Scheduling, Transition Probability Matrix.
User
Notifications
Font Size

Abstract Views: 278

PDF Views: 0




  • A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme

Abstract Views: 278  |  PDF Views: 0

Authors

D. Shukla
Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), India
Saurabh Jain
Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), India
Rahul Singhai
Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), India
R. K. Agarwal
Indira Gandhi Engineering College, Sagar, India

Abstract


In the literature of Round-Robin scheduling scheme, each job is processed, one after the another after giving a fix quantum. In case of First-come first-served, each process is executed, if the previously arrived processed is completed. Both these scheduling schemes are used in this paper as its special cases. A Markov chain model is used to compare several scheduling schemes of the class. An index measure is defined to compare the model based efficiency of different scheduling schemes. One scheduling scheme which is the mixture of FIFO and round robin is found efficient in terms of model based study. The system simulation procedure is used to derive the conclusion of the content.

Keywords


Process Scheduling, Markov Chain Model, State of System, Deadlock State, Process Queue, First-In First-Out (FIFO), Round-Robin Scheduling, Transition Probability Matrix.