Burst Round Robin as a Proportional-Share Scheduling Algorithm

In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low scheduling overhead of round robin algorithms and favor shortest jobs. As being documented that weight readjustment enables existing proportional share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We present a novel weight adjustment for processes that are blocked for I/O and lose some CPU time to assure proportional fairness. Experiments on the implemented simulator showed that quickly knocking away shortest processes achieves better turnaround time, waiting time, and response time. The advantage we gain is that processes that are close to their completion will get more chances to complete and leave the ready queue. This will reduce the number of processes in the ready queue by knocking out short jobs relatively faster in a hope to increase the throughput and reduce the average waiting time. Index Terms Proportional-share CPU scheduling, Quality of Services and Performance Management.

[1]  John Regehr,et al.  Using hierarchical scheduling to support soft real-time applications in general-purpose operating systems , 2001 .

[2]  Arif Merchant,et al.  Proportional Service Allocation in Distributed Storage Systems ∗ , 2006 .

[3]  Michael B. Jones,et al.  CPU reservations and time constraints: implementation experience on windows NT , 1999 .

[4]  John Regehr,et al.  Some Guidelines for Proportional Share CPU Scheduling in General-Purpose Operating Systems , 2001, RTSS 2001.

[5]  Jason Nieh,et al.  Group Ratio Round-Robin: An O(1) Proportional Share Scheduler , 2003 .

[6]  Jason Nieh,et al.  Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems , 2005, USENIX Annual Technical Conference, General Track.

[7]  Giuseppe Lipari,et al.  Constant bandwidth vs. proportional share resource allocation , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[8]  Jason Nieh,et al.  Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler , 2001, USENIX Annual Technical Conference, General Track.

[9]  James H. Anderson,et al.  Proportional share scheduling of operating system services for real-time applications , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[10]  H. Abdel-Wahab,et al.  On the Duality between Resource Reservation and ProportionalShare Resource , 1997 .

[11]  Upamanyu Madhow,et al.  Fair scheduling with tunable latency: a round robin approach , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[12]  Abraham Silberschatz,et al.  Operating Systems Concepts , 2005 .