Extension of scheduling algorithms in case of conditional or parametric synchronisation relationships

Abstract

A hard real time system is composed of a set of tasks with hard deadlines. Real time scheduling algorithms are used to evaluate the priorities of the tasks and then to drive the validation. To realise the priority mapping, it is necessary to obtain a set of temporal and relational characteristics. We compute precedence constraints in case of conditional and parametric synchronisation relationships. Then, we apply the scheduling algorithms and we carry out the validation based on realistic execution modes of the tasks.