Abstract
This report describes a necessary and sufficient test for the schedulability of a set of sporadic hard-deadline tasks on a multiprocessor platform, using any of a variety of scheduling policies including global fixed task-priority and earliest-deadline-first (EDF). The contribution is to establish an upper bound on the computational complexity of this problem, for which no algorithm has yet been described. The compute time and storage complexity of the algorithm, which performs an exhaustive search of a very large state space, make it practical only for tasks sets with very small integer periods. However, as a research tool, it can provide a clearer picture than has been previously available of the real success rates of global preemptive priority scheduling policies and low-complexity sufficient tests of schedulability.
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.
Similar content being viewed by others
References
Andersson, B., Baruah, S., Jonsson, J.: Static-priority scheduling on multiprocessors. In: Proc. 22nd IEEE Real-Time Systems Symposium, London, UK, pp. 193–202 (2001)
Baker, T.P.: An analysis of EDF scheduling on a multiprocessor. IEEE Trans. on Parallel and Distributed Systems 15(8), 760–768 (2005)
Baker, T.P.: An analysis of fixed-priority scheduling on a multiprocessor. Real Time Systems (2005)
Baker, T.P., Cirinei, M.: A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In: Proc. 27th IEEE Real-Time Systems Symposium, Rio de Janeiro, Brazil, IEEE Computer Society Press, Los Alamitos (2006)
Baker, T.P., Fisher, N., Baruah, S.: Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University, Tallahassee, FL (December 2005)
Bemrtogna, M., Cirinei, M., Lipari, G.: Improved schedulability analysis of EDF on multiprocessor platforms. In: Proc. 17th Euromicro Conference on Real-Time Systems, Palma de Mallorca, Spain, pp. 209–218 (July 2005)
Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors. In: Proc. 9th International Conf. on Principles of Distributed Systems, Pisa, Italy (December 2005)
Cho, S., Lee, S.-K., Han, A., Lin, K.-J.: Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Communications E85-B(12), 2859–2867 (December 2002)
Cirinei, M., Baker, T.P.: EDZL scheduling analysis. In: Proc. EuroMicro Conference on Real-Time Systems, Pisa, Italy (to appear, July 2007)
Goossens, J., Funk, S., Baruah, S.: Priority-driven scheduling of periodic task systems on multiprocessors. Real Time Systems 25(2–3), 187–205 (2003)
Ha, R., Liu, J.W.S.: Validating timing constraints in multiprocessor and distributed real-time systems. In: Proc. 14th IEEE International Conf. Distributed Computing Systems, Poznan, Poland, pp. 162–171. IEEE Computer Society Press, Los Alamitos (1994)
Johnson, H.H., Maddison, M.S.: Deadline scheduling for a real-time multiprocessor. In: Proc. Eurocomp Conference, pp. 139–153 (1974)
Piao, X., Han, S., Kim, H., Park, M., Cho, Y., Cho, S.: Predictability of earliest deadline zero laxity algorithm for multiprocessor real time systems. In: Proc. 9th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing, Gjeongju, Korea, IEEE Computer Society Press, Los Alamitos (April 2006)
Srinivasan, A., Baruah, S.: Deadline-based scheduling of periodic task systems on multiprocessors. Information Processing Letters 84, 93–98 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baker, T.P., Cirinei, M. (2007). Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. In: Tovar, E., Tsigas, P., Fouchal, H. (eds) Principles of Distributed Systems. OPODIS 2007. Lecture Notes in Computer Science, vol 4878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77096-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77096-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77095-4
Online ISBN: 978-3-540-77096-1
eBook Packages: Computer ScienceComputer Science (R0)