面向多核的时间帧加权公平调度算法  

Weighed Time Frame Based on Multi-Cores Task Fair Scheduling

作　　者：黎卫红 刘羽[2] 芦奉良[3] 

机构地区：[1]广西区科学技术厅,南宁530012 [2]桂林理工大学机械与控制工程学院,广西桂林541004 [3]桂林理工大学信息科学与工程学院,广西桂林541004

出　　处：《桂林理工大学学报》2012年第1期121-125,共5页Journal of Guilin University of Technology

基　　金：广西自然科学基金项目(桂科自0832249);广西教育厅重点科研项目(201102ZD018)

摘　　要：多核系统在移动终端、多媒体设备上的广泛应用对于多核系统的调度提出了新的要求,由于这些多核设备中大量的周期性与实时动态任务的执行,使得传统的Pfair和ERfair等经典算法产生了大量的任务迁移,同时对于动态任务调度并不能提供良好的支持。因此,在Pfair经典调度算法的基础上,结合EDF等局部调度算法,以时间帧的模式轮转多任务的周期执行,并采用处理器时间帧间的任务固定来降低任务的迁移率。仿真实验表明,在对任务调度公平性影响很小的情况下,大大降低了任务的迁移率并能更好的处理动态任务,具有更高的效率和更为广泛的使用范围。Muhicores systems are widely used on mobile terminals and multimedia equipment, with new re- quests to the task schedule. Due to the execution of a large number of periodic and real-time dynamic tasks, the traditional Pfair and ERfair algorithm cause a lot of task migrations. So, these algorithms could not provide good supports for task schedule. Based on Pfair scheduling algorithm and combined with local scheduling algo- rithms such as EDF, the task migrations can be reduced by the model of cycle time frames to execute periodic tasks and technology of task-fixing among processor time frames. The result of simulate experiments proves that the new algorithm can reduce the task migration and provide better support to dynamic tasks execution, with high efficiency and extensive use of the range of fields.

关 键 词：多核系统 任务调度 公平调度 任务迁移 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]