The Performance Evaluation of Rate Monotonic Tasks Assignment Algorithms on Multiprocessor
Liu Da · 2007
Tasks allocation and scheduling algorithms on multiprocessors are a kind of classic real-time scheduling algorithms.However the current study lacks of guiding principles on how to select the proper algorithm based on the task sets’ characteristics. It is not conducive to improve the rate of schedulability of the multiprocessor tasks allocation algorithms as well as obtain the optimal results using the minimal the processors.The schedulability conditions and task allocation algorithms as well as analysis of RM scheduling under multiprocessor partition scheme are given based on the comparation of the both multiprocessor tasks scheduling schemes in this paper.Simulation result shows that the number of processors required by all task allocation algorithms is proportional to the total utilization of the task set;the applicable area of the given algorithms and the guiding principles on how to select the proper algorithm based on the task sets’ utilization are summed up.The final result also shows that there is difference between the practice performance and the theoretic performance bound of the algorithms.