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

Jeremy P. Erickson, James H. Anderson
2011 Lecture Notes in Computer Science  
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
more » ... equirement that no task overutilize a single processor. We also provide tardiness bounds that are better than those available with the standard sporadic task model.
doi:10.1007/978-3-642-25873-2_10 fatcat:35nyxaslo5evfmevg7lajj35uu