Schedulability Analysis of Distributed Real-Time applications Under Dependence and Several Latency Constraints
In this paper, the authors focus on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori -without executing or simulating-if its scheduling of tasks will hold the precedence between tasks as well as several latency constraints imposed on determined pairs of tasks. It is shown that the required analysis is closely linked to the topological structure of the application graph. More precisely, it depends on the configuration of tasks paths subject to latency constraints.