An Efficient Real-Time Multiprocessor Scheduling Algorithm

Download Now
Provided by: AICIT
Topic: Hardware
Format: PDF
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, the authors present an efficient real-time multiprocessor scheduling algorithm in which the fairness rule is completely relaxed and a semi-greedy algorithm is introduced.
Download Now

Find By Topic