Abstract
In this paper we present an exact schedulability test for sporadic real-time tasks scheduled by the Global Fixed Priority Fully Preemptive Scheduler on a multiprocessor system. The analysis consists in modeling the system as a Linear Hybrid Automaton, and in performing a reachability analysis for states representing deadline miss conditions. To mitigate the problem of state space explosion, we propose a pre-order relationship over the symbolic states of the model: states that are simulated by others can be safely eliminated from the state space. We also formulate the concept of decidability interval with respect to a set of constrained-deadline sporadic tasks on multiprocessor. The decidability interval is a bounded time interval such that, if a deadline miss occurs in the schedule, then it is possible to find a configuration of arrival times for the tasks such that the deadline miss happens within the bounded interval. Vice versa, if no configuration of arrival times produces a deadline miss in the bounded interval, then no deadline miss is ever possible in the schedule. Hence we prove that the schedulability analysis problem is decidable, and we provide a formula for computing the decidability interval. To our knowledge, this is the first time such a time interval is proposed for sporadic tasks running on multiprocessor. The proposed schedulability analysis has been implemented in a software tool. For the first time we assess the pessimism of the state-of-the-art approximate schedulability test through experiments. Moreover, we show that the use of the proposed model permits to analyse tasks with more general parameter values than other exact algorithms in the literature. Nevertheless, even with our approach the complexity remains too high for analysing practical task sets with more than seven tasks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
A committed location is a location where time is not allowed to elapse; more details can be found in Bengtsson and Yi (2004).
References
Alur R, Courcoubetis C, Henzinger TA, Ho PH (1993) Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. Springer, Heidelberg
Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho PH, Nicollin X, Olivero A, Sifakis J, Yovine S (1995) The algorithmic analysis of hybrid systems. Theor Comput Sci 138(1):3–34
Baker T (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE Real-Time Systems Symposium (RTSS)
Baker T, Baruah SK (2009) Sustainable multiprocessor scheduling of sporadic task systems. In: 21st Euromicro Conference on IEEE Real-Time Systems, 2009. ECRTS’09, pp 141–150
Baker T, 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 (Lecture Notes in Computer Science) vol 4878. Springer, Berlin Heidelberg, p 6275
Baruah S (2007) Techniques for Multiprocessor Global Schedulability Analysis. In: 28th IEEE International Real-Time Systems Symposium, 2007. RTSS 2007. pp 119–128. doi: 10.1109/RTSS.2007.35
Bengtsson J, Yi W (2004) Timed automata: semantics, algorithms and tools. Springer, Berlin, pp 87–124
Bertogna M, Cirinei M (2007) Response-time analysis for globally scheduled symmetric multiprocessor platforms. In: 28th IEEE International Real-Time Systems Symposium, 2007. RTSS 2007, pp 149–160
Bonifaci V, Marchetti-Spaccamela A (2012) Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63(4):763–780
Brihaye T, Doyen L, Geeraerts G, Ouaknine J, Raskin JF, Worrell J (2011) On reachability for hybrid automata over bounded time. In: Automata, Languages and Programming. Springer, Berlin, pp 416–427
Bucci G, Fedeli A, Sassoli L, Vicario E (2004) Timed state space analysis of real-time preemptive systems. IEEE Trans Softw Eng 30(2):97–111
Cassez F, Larsen K (2000) The impressive power of stopwatches. In: Proceedings of CONCUR 2000: Concurrency Theory, Springer, pp 138–152
Cucu L, Goossens J (2006) Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors. In: IEEE Conference on Emerging Technologies and Factory Automation, 2006. ETFA’06, pp 397–404
Cucu L, Goossens J (2007) Feasibility intervals for multiprocessor fixed-priority scheduling of arbitrary deadline periodic systems. In: Proceedings of the Conference on Design, Automation and Test in Europe, EDA Consortium, pp 1635–1640
Cucu-Grosjean L, Goossens J (2011) Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms. J Syst Archit 57(5):561–569
Emberson P, Stafford R, Davis RI (2010) Techniques for the synthesis of multiprocessor tasksets. In: 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), pp 6–11
Geeraerts G, Goossens J, Lindstrm M (2013) Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. Real-Time Syst 49(2):171–218. doi:10.1007/s11241-012-9172-y
Geeraerts G, Goossens J, Stainer A (2014) Synthesising succinct strategies in safety and reachability games. In: Reachability Problems—8th International Workshop, RP 2014, Oxford, UK, September 22–24, 2014. Proceedings, pp 98–111
Grolleau E, Goossens J, Cucu-Grosjean L (2013) On the periodic behavior of real-time schedulers on identical multiprocessor platforms. arXiv:1305.3849, preprint
Guan N, Gu Z, Deng Q, Gao S, Yu G (2007) Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking. In: Software Technologies for Embedded and Ubiquitous Systems, Springer, pp 263–272
Guan N, Gu Z, Lv M, Deng Q, Yu G (2008) Schedulability analysis of global fixed-priority or EDF multiprocessor scheduling with symbolic model-checking. In: 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC), 2008, pp 556–560
Guan N, Stigge M, Yi W, Yu G (2009) New response time bounds for fixed priority multiprocessor scheduling. In: 30th IEEE Real-Time Systems Symposium, 2009, RTSS 2009, pp 387–397
Halbwachs N, Proy YE, Roumanoff P (1997) Verification of real-time systems using linear relation analysis. Formal Methods Syst Des 11(2):157–185
Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J Assoc Comput Mach 20(1):46–61
Miné A (2001) A new numerical abstract domain based on difference-bound matrices. In: Proceedings of the Second Symposium on Programs as Data Objects. Springer, London, UK, UK, PADO ’01, pp 155–172, URL: http://dl.acm.org/citation.cfm?id=645774.668110
Miné A (2006) The octagon abstract domain. Higher-Order Symb Comput 19(1):31–100. doi:10.1007/s10990-006-8609-1
Sun Y, Lipari G (2014a) FOrmal Real-Time Scheduler (FORTS). Web page: https://github.com/glipari/forts
Sun Y, Lipari G (2014b) A weak simulation relation for real-time schedulability analysis of global fixed priority scheduling using linear hybrid automata. In: Proceedings of the 22nd International Conference on Real-Time Networks and Systems, ACM, p 35
Sun Y, Lipari G, André É, Fribourg L (2014a) Toward parametric timed interfaces for real-time components. In: Proceedings 1st International Workshop on Synthesis of Continuous Parameters, SynCoP 2014, Grenoble, France, 6th April 2014, pp 49–64. doi: 10.4204/EPTCS.145.6
Sun Y, Lipari G, Guan N, Yi W (2014b) Improving the response time analysis of global fixed-priority multiprocessor scheduling. In: IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 2014, pp 1–9
Acknowledgments
The authors would like to thank the anonymous reviewers for their very useful comments. This work has been supported by the 7th Framework Programme JUNIPER (FP7-ICT-2011.4.4) project, founded by the European Community under grant agreement n. 318763.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is an extended version of a prior RTNS 2014 paper (Sun and Lipari 2014b).
Rights and permissions
About this article
Cite this article
Sun, Y., Lipari, G. A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling. Real-Time Syst 52, 323–355 (2016). https://doi.org/10.1007/s11241-015-9245-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-015-9245-9