Burst Round Robin as a Proportional-Share Scheduling Algorithm

@inproceedings{Helmy2007BurstRR,
  title={Burst Round Robin as a Proportional-Share Scheduling Algorithm},
  author={Tarek Helmy and Abdelkader Dekdouk},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
24 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Group Round-Robin: Improving the Fairness and Complexity of Packet Scheduling

  • B. Caprita, W. C. Chan, J. Nieh
  • Technical Report CUCS-018-03,
  • 2003
2 Excerpts

Hierarchical Scheduling to Support Soft Real-Time Applications on GeneralPurpose Operating Systems

  • John Regehr, ”Using
  • PhD thesis, University of Virginia,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…