EDF schedulability test for the E-TDL time-triggered framework

Abstract

Time-triggered architectures bring to the applications a considerable degree of determinism and a strong conformity between their execution and their logical model. The Extended Timing Definition Language (E-TDL) is a time-triggered framework for programming real-time applications that can be structured through multiple independent components with fully adaptive behaviors. In this paper, we propose a schedulability test for E-TDL applications executed under Earliest Deadline First on a single processor. We derive an efficient solution for evaluating the maximal processor demand over the time intervals during which application may change its operational modes. We provide a detailed insight into the schedulability test procedure and discuss its complexity. Simulation results illustrate the performance of the current implementation of the test.