Scholars Central

Research articlePublished May 2011

Weighted Mean Priority Based Scheduling for Interactive Systems

Authors: H.S.Behera, Sabyasachi Sahu, Sourav Kumar Bhoi

Journal of Global Research in Computer Sciences

Volume 2 · Issue 5 · Pages 1–7

Ask about this article

Abstract

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

Scheduling in Operating System means determining which tasks are supposed to run when there are multiple tasks to be run. Consequently, the efficiency and performance of a system mainly depends on CPU scheduling algorithm where CPU is considered as one of the primary computer resource. Traditionally, Priority Scheduling Algorithm is used for processes in which priority is the determining factor. This paper proposes a newly improved process scheduling algorithm by using dynamic time quantum along with weighted mean. Experimental analysis demonstrates that this proposed algorithm gives better response time making the algorithm useful for interactive systems.

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 “H.S.Behera”
  • BylineArticles whose byline prints “Sabyasachi Sahu”
  • BylineArticles whose byline prints “Sourav Kumar Bhoi”

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