An Efficient Real-Time Multiprocessor Scheduling Algorithm

Most currently existing optimal real-time multiprocessor scheduling algorithms follow the fairness rule, in which all tasks are forced to make progress in their executions proportional to their utilization, to ensure the optimality of the algorithm. However, obeying the fairness rule results in large number of task preemptions and migrations and these highly affect the practicability of the algorithm. In this paper, we present an efficient real-time multiprocessor scheduling algorithm in which the fairness rule is completely relaxed and a semi-greedy algorithm is introduced. In the simulation, the proposed algorithm showed promising results in terms of number of task preemptions and migrations that are very few compared to the current state of the art real-time multiprocessor scheduling algorithms. Although the algorithm can sometimes miss a very few deadlines, we assume that these deadline misses can be tolerated in view of the great reduction of task preemptions and migrations.