Response Time Bounds for G-EDF without Intra-Task Precedence Constraints
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.
KeywordsPrecedence Constraint Piecewise Linear Function Task System Sporadic Task Sporadic Task System
Unable to display preview. Download preview PDF.
- 2.Erickson, J.P., Devi, U.C., Baruah, S.K.: Improved tardiness bounds for global EDF. In: ECRTS, pp. 14–23 (2010)Google Scholar
- 6.Anderson, J.H., Srinivasan, A.: Early-release fair scheduling. In: ECRTS, pp. 35–43 (2000)Google Scholar
- 7.Durbin, M.: All About High-Frequency Trading, 1st edn. McGraw-Hill (2010)Google Scholar
- 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