摘要
多处理器任务分配调度算法是一类经典实时调度算法,然而目前研究在如何根据任务集特征选择任务分配算法方面少见指导性原则,不利于提高多处理器任务分配算法的可调度率及使用尽可能少的处理器达到最优调度结果。基于两种多处理器任务调度策略的比较,本文给出划分策略下的多处理器RM调度的可调度条件和任务分配算法及分析。仿真结果表明,各任务分配算法所需处理器数与任务集总利用率成正比。同时,分析总结出各算法适用范围及如何根据任务集利用率选择合适算法的指导原则。最后结果还表明,实际算法性能与理论性能界存在差异。
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 schedulabilityconditions 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.
出处
《计算机科学》
CSCD
北大核心
2007年第1期272-277,共6页
Computer Science
基金
黑龙江省自然科学基金资助(项目编号:F2005-02)
关键词
多处理器
速率单调
划分
可调度性
Multiprocessor,Rate monotonic,Partition, Schedulability
