Schedulability Analysis of Distributed Real-Time Applications under Dependence and Several Latency Constraints

TL;DR

This paper presents a new schedulability analysis method for distributed real-time applications with precedence and latency constraints, enabling designers to verify schedulability without simulation, based on application graph structure.

Contribution

It introduces a sufficient schedulability condition linked to the application graph topology, applicable to the hardest configurations with optimal processor count.

Findings

Effective schedulability condition for complex constraints

Performance results show improved analysis efficiency

Provides practical lower bounds for general cases

Abstract

This paper focuses 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 precedences 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. As a result of the study, a sufficient schedulability condition is introduced for precedences and latency constraints in the hardest configuration in term of complexity with an optimal number of processors in term of applications parallelism. In addition, the proposed conditions provides a practical lower bounds for general cases. Performances results and comparisons with an optimal approach demonstrate the effectiveness of the proposed approach.