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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/1462/1/d3_s18_p3_1569045631.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|