Pfair scheduling: beyond periodic task systems

@inproceedings{Anderson2000PfairSB,
  title={Pfair scheduling: beyond periodic task systems},
  author={James H. Anderson and Anand Srinivasan},
  booktitle={RTCSA},
  year={2000}
}
Prior work on multiprocessor Pfair scheduling algorithms has almost exclusively focused on synchronous, periodic task systems. Under Pfair scheduling, each task is broken into quantum-length subtasks, each of which must execute within a \window" of time slots. These windows divide each period of a task into subintervals of approximately equal length. \Early-release" fair (ERfair) scheduling was recently proposed as a work-conserving variant of Pfair scheduling in which subtasks within the same… CONTINUE READING
Highly Cited
This paper has 120 citations. REVIEW CITATIONS
79 Citations
11 References
Similar Papers

Citations

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

120 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 120 citations based on the available data.

See our FAQ for additional information.

References

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

A new look at pfair priorities

  • J. Anderson, A. Srinivasan
  • In Submission,
  • 1999
Highly Influential
3 Excerpts

Early - release fairs heduling

  • A. Srinivasan, A. Srinivasan.
  • 2000

Proportionate progress : A notion of fairness in resour eallo ation

  • N. Cohen S. Baruah, C. G. Plaxton, D. Varvel
  • Algorithmi a
  • 1996

Fast s heduling of periodi tasks on multiple resour es

  • J. Gehrke, C. G. Plaxton
  • Pro . of the 9 th International Parallel Pro…
  • 1995

Similar Papers

Loading similar papers…