Modelling and analysis of real-time systems on multi-core processors

In this paper we study and model the schedulability problem for multi-core real-time systems using an extended task automata, which was first proposed as an event-driven task model for real time systems with non-uniformly recurring computation tasks. Original task automata allow only one calculation unit to process tasks, i.e. on a single-core processor. With the extension presented in this paper, we eliminate this restriction and allow more calculation units, i.e. on a multi-core processor. The most significant application of this extension is in the analysis of schedulability on a multi-core processor with implicit task migration. We use task automata to model the non-deterministic arrival times of tasks. Schedulability problem is to check whether all the released tasks may finish within their deadlines on multi-core systems. We shall show that schedulability of a multi-core task automaton is decidable under such circumstances as (1) task feedback is not allowed, (2)task execution time is fixed, i.e. best and worst execution time are equal.