Response Time Bounds for G-EDF without Intra-Task Precedence Constraints

  • Jeremy P. Erickson
  • James H. Anderson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7109)


Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all processors. In this work we generalize the task model by allowing jobs within a single task to run concurrently. In doing so we remove the requirement that no task overutilize a single processor. We also provide tardiness bounds that are better than those available with the standard sporadic task model.


Precedence Constraint Piecewise Linear Function Task System Sporadic Task Sporadic Task System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Devi, U.C., Anderson, J.H.: Tardiness bounds under global EDF scheduling on a multiprocessor. The Journal of Real-Time Systems 38(2), 133–189 (2008)CrossRefzbMATHGoogle Scholar
  2. 2.
    Erickson, J.P., Devi, U.C., Baruah, S.K.: Improved tardiness bounds for global EDF. In: ECRTS, pp. 14–23 (2010)Google Scholar
  3. 3.
    Erickson, J.P., Guan, N., Baruah, S.K.: Tardiness Bounds for Global EDF with Deadlines Different from Periods. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 286–301. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Leontyev, H., Anderson, J.H.: Generalized tardiness bounds for global multiprocessor scheduling. The Journal of Real-Time Systems 44(1), 26–71 (2010)CrossRefzbMATHGoogle Scholar
  5. 5.
    Baker, T., Baruah, S.K.: An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems. The Journal of Real-Time Systems 43(1), 3–24 (2009)CrossRefzbMATHGoogle Scholar
  6. 6.
    Anderson, J.H., Srinivasan, A.: Early-release fair scheduling. In: ECRTS, pp. 35–43 (2000)Google Scholar
  7. 7.
    Durbin, M.: All About High-Frequency Trading, 1st edn. McGraw-Hill (2010)Google Scholar
  8. 8.
    Baruah, S.K., Mok, A.K., Rosier, L.E.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: RTSS, pp. 182–190 (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jeremy P. Erickson
    • 1
  • James H. Anderson
    • 1
  1. 1.University of North Carolina at Chapel HillUSA

Personalised recommendations