周期实时任务在多处理器下的可调度条件  

Allocating Criterion for Periodic Hard-Real-Time Task in Multiprocessor Systems

作　　者：杨根科[1] 吴智铭[1] 

机构地区：[1]上海交通大学自动化系,上海200030

出　　处：《上海交通大学学报》2004年第9期1597-1600,共4页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(60174009)

摘　　要：研究硬实时周期任务在并行等同多处理器下的可调度问题.在任务/处理器静态绑定和周期任务静态优先权配置策略下,依据单处理器情形下的最优配置RM策略作为一项任务在单个处理器上的可配置条件,给出了以实时任务集合的任务数、利用率和与利用率递减排序为特点的在多处理器环境下的可调度新判据.新判据拓宽了基于阈值判据的可判定范围.最后通过实例分析说明新判据的有效性.This paper considers the schedulability of a set of independent periodic hard-real-time tasks scheduled on identical multiprocessor systems, in which tasks are not permitted to migrate between processors and fixed preemptive priority. The tasks are assigned on an available individual processor according to the Rate Monotonic priority and the RM schedulable condition. Three allocation criterions being characterized by the number, sequence and utilization sum of task set were proposed. The new conditions are prior to a previous criterion given by the threshold of the worst case achievable utilization sum. The examples and analysis show the new methods are efficient.

关 键 词：调度 多等同处理器 硬实时任务 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]