A polynomial time algorithm for analyzing the schedulability of non-linear task

摘要

The present invention relates to a polynomial time algorithm for analyzing the schedulability of a non-linear cyclic task, wherein the algorithm provided by the present invention comprises a first step of sorting all tasks in the system in ascending order of cycles, A second step of determining a required amount of a processor when performing the first step and a second step of determining if the required amount of the processor is greater than 1 when the second processor is required to be executed; A fourth step of determining whether a schedule is satisfied if all the tasks meet the predetermined condition as a result of the third step and if not, (Earliest Deaded Line First) real time algorithm The problem of whether the deadline can be guaranteed 100% at the time of scheduling can be judged as a polynomial time before the scheduling.