Abstract
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real-time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor platform where each processor has a task queue to buffer task instances scheduled to run on the processor. On the positive side, we show that the problem is decidable for systems with non-preemptive schedulers or tasks with fixed execution times. A surprising negative result is that for multi-processor systems with variable task execution times and a preemptive scheduler, the schedulability analysis problem is undecidable, which is still an open problem in the single-processor setting.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andersson, B., Baruah, S., Jonsson, J.: Static-priority scheduling on multiprocessors. In: Proc. of RTSS 2001, pp. 193–202. IEEE Computer Society Press, Los Alamitos (2001)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Baker, T., Baruah, S.: Handbook of Real-Time and Embedded Systems. In: Schedulability Analysis of Multiprocessor Sporadic Task Systems, CRC Press, Boca Raton (2006)
Bertogna, M., Cirinei, M., Lipari, G.: Improved schedulability analysis of EDF on multiprocessor platforms. In: Proc. of ECRTS 2005, pp. 209–218. IEEE Computer Society Press, Los Alamitos (2005)
Buttazzo, G.C.: Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1997)
Ericsson, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: Proc. of RTCSA 1999, pp. 182–205. IEEE Computer Society, Los Alamitos (1999)
Fersman, E., Krcal, P., Pettersson, P., Yi, W.: Task automata: Schedulability, decidability and undecidability. Information and Computation 205(8), 1149–1172 (2007)
Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Schedulability analysis of fixed priority systems using timed automata. Theoretical Computer Science 354(2), 301–317 (2006)
Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? Journal of Computer and System Sciences 57, 94–124 (1998)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
Real, J., Crespo, A.: Offsets for scheduling mode changes. In: Proc. of ECRTS 2001, pp. 3–10. IEEE Computer Society Press, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krcal, P., Stigge, M., Yi, W. (2007). Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-75454-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75453-4
Online ISBN: 978-3-540-75454-1
eBook Packages: Computer ScienceComputer Science (R0)