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. © 2011 Springer-Verlag.
CITATION STYLE
Erickson, J. P., & Anderson, J. H. (2011). Response time bounds for G-EDF without intra-task precedence constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7109 LNCS, pp. 128–142). https://doi.org/10.1007/978-3-642-25873-2_10
Mendeley helps you to discover research relevant for your work.