Reduction of task migrations and preemptions in optimal real-time scheduling for multiprocessors by using dynamic T-L plane

摘要

Highlights ? A significant number of task preemptions and task migrations is reduced by D-TLPA compared with state-of-the-art algorithms. ? The proposed algorithm is totally executed on-line making it affective when dealing with systems where the condition changes dynamically at run-time, for example, when tasks are frequently added or removed. ? The concept of the proposed idea is simple and easy to realize in practice. The complexity bound is also presented to prove the feasibility of the proposed algorithm. Abstract A new method for optimally scheduling tasks in multiprocessors is proposed in this paper: Dynamic Time and Local R