Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Erickson, J.P., Devi, U.C., Baruah, S.K.: Improved tardiness bounds for global EDF. In: ECRTS, pp. 14–23 (2010)
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)
Leontyev, H., Anderson, J.H.: Generalized tardiness bounds for global multiprocessor scheduling. The Journal of Real-Time Systems 44(1), 26–71 (2010)
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)
Anderson, J.H., Srinivasan, A.: Early-release fair scheduling. In: ECRTS, pp. 35–43 (2000)
Durbin, M.: All About High-Frequency Trading, 1st edn. McGraw-Hill (2010)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erickson, J.P., Anderson, J.H. (2011). Response Time Bounds for G-EDF without Intra-Task Precedence Constraints. In: Fernà ndez Anta, A., Lipari, G., Roy, M. (eds) Principles of Distributed Systems. OPODIS 2011. Lecture Notes in Computer Science, vol 7109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25873-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-25873-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25872-5
Online ISBN: 978-3-642-25873-2
eBook Packages: Computer ScienceComputer Science (R0)