关键词: 速率单调, 任务分配, 可调度性, 利用率界

Abstract: The scheduling strategies and schedulability conditions of RM(Rate Monotonic) tasks allocation algorithms were analyzed, and the actions that how the tasks allocation algorithms allocate the task to processors were depicted in detail based on the model of preemptive period task in multiprocessor system. According to the theory of Liu & Layland, the theory of the minimum utilization bound for task allocation algorithm was presented. The results of simulation show that the utilization bound of allocation algorithm is the key principle for differently characterized task sets to select different algorithms to allocate tasks. Through the comparison between the total utilization of the task set and the utilization bound of the algorithm, it can be judged whether the algorithm will bring out feasible allocation of the task set.

Key words: rate monotonic, tasks allocation, schedulability, utilization bound