Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource

@article{Baruah1997FairOS,
  title={Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource},
  author={Sanjoy K. Baruah and Johannes Gehrke and C. Greg Plaxton and Ion Stoica and Hussein M. Abdel-Wahab and Kevin Jeffay},
  journal={Inf. Process. Lett.},
  year={1997},
  volume={64},
  pages={43-51}
}
Consider a set of \tasks" competing for the use of a single \resource", where: (i) only one task is allowed to use the resource at a time, (ii) the resource is scheduled in unit-time intervals, (iii) each task requires a speci c fraction of the resource capacity over an extended period, and (iv) tasks arrive and depart at any time. We refer to such a task system as an instance of the single-resource scheduling problem. The problem of designing a \fair" scheduling algorithm for such task systems… CONTINUE READING
21 Citations
17 References
Similar Papers

References

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

Earliest eligible virtual deadline rst: A exible and accurate mechanism for proportional share resource allocation

  • I. Stoica, H. Abdel-Wahab
  • Technical Report TR{ 95{22,
  • 1995
Highly Influential
4 Excerpts

A new approach to implement proportional share re- source allocation

  • I. Stoica, H. Abdel-Wahab
  • Technical Report TR{95{05,
  • 1995
1 Excerpt

Charge - based proportional scheduling

  • E. M. McCreight.
  • 1995

Similar Papers

Loading similar papers…