实时多处理器系统的双优先级调度算法  

Dual Priority Schedule Algorithm for Real-time Multi-processor System

作　　者：张益嘉[1] 马洪连[1] 丁男[1] 

机构地区：[1]大连理工大学计算机学院,辽宁大连116023

出　　处：《计算机工程》2011年第1期265-267,共3页Computer Engineering

摘　　要：针对同构多处理器系统提出一种基于双优先级的实时任务调度算法。对偶发任务进行接受测试,进一步提高了系统对偶发任务调度的成功率。模拟结果表明,当多核处理器系统利用率达到极限时,该算法依然能够在完成强实时周期任务的成功调度前提下,保证软实时周期任务和偶发任务具有较高的调度成功率。This paper presents a real-time task schedule algorithm based on dual priority for the homogeneous multi-processor system. Aiming at the character of sporadic tasks, the algorithm pretests the sporadic tasks and further improves the success rate of sporadic tasks schedule. The simulation results show that when the multi-core processor system utilization is at the limit, the algorithm is still able to schedule the hard real-time periodic tasks successfully and ensure the high success schedule rate of soft real-time periodic tasks and sporadic tasks.

关 键 词：同构多处理器系统 双优先级 偶发任务 

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