Abstract
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-scheduled real-time systems that can be modeled as collections of recurrent tasks modeled using the well-known implicit-deadline (Liu and Layland) task model. This research extends the applicability of previous techniques to systems that are modeled using the more general arbitrary sporadic task model. It also improves on prior work even for implicit-deadline systems. An algorithm is derived here that computes tardiness bounds in polynomial time. Previously, these bounds could only have been approximated in sub-exponential time.
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., Baruah, S.K.: Improved tardiness bounds for global EDF. In: Euromicro Conference on Real-Time Systems, pp. 14–23 (2010)
Leontyev, H.: Compositional Analysis Techniques For Multiprocessor Soft Real-Time Scheduling. PhD thesis, Department of Computer Science, The University of North Carolina at Chapel Hill (2010)
Leontyev, H., Anderson, J.H.: Generalized tardiness bounds for global multiprocessor scheduling. The Journal of Real-Time Systems 44(1), 26–71 (2010)
Erickson, J.P., Guan, N., Baruah, S.K.: Addendum to tardiness bounds for global EDF with deadlines different from periods. Technical Report TR10-014, The University of North Carolina at Chapel Hill, Computer Science department (September 2010), ftp://ftp.cs.unc.edu/pub/publications/techreports/10-014.pdf
Baruah, S.K., Mok, A.K., Rosier, L.E.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: IEEE Real-Time Systems Symposium, pp. 182–190 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erickson, J., Guan, N., Baruah, S. (2010). Tardiness Bounds for Global EDF with Deadlines Different from Periods. In: Lu, C., Masuzawa, T., Mosbah, M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17653-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-17653-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17652-4
Online ISBN: 978-3-642-17653-1
eBook Packages: Computer ScienceComputer Science (R0)