Improved Tardiness Bounds for Global EDF

  title={Improved Tardiness Bounds for Global EDF},
  author={Jeremy P. Erickson and UmaMaheswari Devi and Sanjoy K. Baruah},
  journal={2010 22nd Euromicro Conference on Real-Time Systems},
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the maximum tardiness– the amount of time by which deadlines may be missed– of any feasible system of implicit-deadline sporadic tasks scheduled using global EDF. However, it is known that these bounds are not tight. In this paper, we derive an algorithm for obtaining tardiness bounds that are superior to… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
25 Citations
15 References
Similar Papers


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


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

Corrigendum to tardiness bounds under EDF scheduling on a multiproces

  • J. Anderson.
  • 2010

Corrigendum to tardiness bounds under EDF scheduling on a multiprocessor

  • U. Devi, J. Anderson
  • Technical report, Department of Computer Science…
  • 2010
2 Excerpts

An analysis of EDF schedulability on a multiprocessor

  • T. P. Baker
  • IEEE Transactions on Parallel and Distributed…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…