Scholars Central

Research articlePublished Jun 2011

A MARKOV CHAIN MODEL FOR ROUND ROBIN SCHEDULING IN OPERATING SYSTEM

Authors: Deepak Sisodia, Dr. Sohan Garg

Journal of Global Research in Computer Sciences

Volume 2 · Issue 6 · Pages 1–5

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Deepak Sisodia”
  • BylineArticles whose byline prints “Dr. Sohan Garg”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels