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

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

2010-06-14

arxiv.org/abs/1006.2680v1

Computer Science

Networking and Internet Architecture

7 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422318