Edf - implementation for real time systems with statistical priorities

摘要

The invention relates to a method for implementing a sorting principle for the compilation of a time sequence of tasks Ti to be completed for a real-time operating system (RTOS), wherein the task having the shortest maximum processing time Di (relative deadline) is processed first by the real-time operating system, and the real-time operating system itself assigns to individual tasks static priorities PRi that cannot be changed during operation, and completes the tasks according to the ranking of the priorities, and tasks are activated in the real-time operating system by means of functions F. The method is connected upstream of the real-time operating system, without changing the real-time operating system itself, wherein the method receives the tasks Ti to be executed and thus sorts them into an ordered, dynamic task list according to the time remaining before the corresponding last absolute processing time di expires, so that a task having a shorter remaining time until the last absolute processing time thereof is assigned a lower list position Li than a task having a longer remaining time until the last absolute processing time thereof. The method activates the tasks of the real-time operating system by means of functions F, so that the task To, located at the lowest position L0 of the list, is always processed. The last absolute processing time di is therefore the point in time resulting from the sum of the last processing time period Di (relative deadline), which considers only the processing time, and the activation time ri at which the task Ti was activated in the present method.