A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average

Details A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average

2011-11-22

arxiv.org/abs/1111.5348v1

IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, 2011, 224-229

Computer Science

Operating Systems

6 pages, 4 figures

Scientific paper

Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. In this paper, we propose a new algorithm, called AN, based on a new approach called dynamic-time-quantum; the idea of this approach is to make the operating systems adjusts the time quantum according to the burst time of the set of waiting processes in the ready queue. Based on the simulations and experiments, we show that the new proposed algorithm solves the fixed time quantum problem and increases the performance of Round Robin.

Affiliated with

Also associated with

No associations

Rating

A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average 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 New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376280