Time Sharing Algorithm with Dynamic Weighted Harmonic Round Robin

Mohammad Saber Iraji

Journal of Asian Scientific Research, 2015, vol. 5, issue 3, 131-142

Abstract: In operating system is an important issue, Allocates processor time to processes, to be fair. We presented in This paper proposed methods to reduce Average waiting time, average response time, Switch Counts process, through the design of a time sharing non-exclusive scheduling algorithm based on the round Robin and determined accurate time quantum . Among the proposed approaches, weight harmonic- dynamic weight and Subtraction Method are achieved better and more accurate results.

Keywords: Round robin; Time quantum; Scheduling; Operation systems; Waiting time; Response time. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://archive.aessweb.com/index.php/5003/article/view/3714/5871 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:asi:joasrj:v:5:y:2015:i:3:p:131-142:id:3714

Access Statistics for this article

More articles in Journal of Asian Scientific Research from Asian Economic and Social Society
Bibliographic data for series maintained by Robert Allen ().