并行实时任务调度判定分析  

Parallel Real-time Tasks Schedulability Analysis on Multi-core Processors

作　　者：周正勇[1] 庞丽萍[1] 阳富民[1] 涂刚[1] 张杰[1] 

机构地区：[1]华中科技大学计算机科学学院,武汉430074

出　　处：《小型微型计算机系统》2015年第4期826-829,共4页Journal of Chinese Computer Systems

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

摘　　要：多核处理器凭借着高性能上的优势逐步取代单核处理器.传统实时任务使用串行任务模型,不能充分发挥多核处理的优势,而基于有向无环图的并行实时任务周期内释放多个作业,这些作业同时运行.并行实时任务集的可调度性是研究的重点,针对该模型分析并证明了在某些条件下全局最早截止期优先算法和单调时限算法的可调度性判定,根据分析的结果提出了实时任务集可调度的判定流程,最后采用资源增值分析了两种判定条件的性能.With high performance characteristics, multi-core processors have occupied the main market. Real-time tasks using sequen- tial programming model cannot be taken full advantage of multi-core processors. Parallel real-time tasks repeatedly emits a job collec- tion, which can be utilized multiple cores. Determining how parallel real-time tasks can be scheduled on multi-core platform is a re- search focus. We analysis feasibility for the sporadic task model. In this model each task is specifed as a directed acyclic graph. We present special schedulability tests for GEDF and DM to determine whether a set of task can meet all deadlines on multi-core proces- sors and give the resource augmentation bound of these schedulability tests.

关 键 词：实时调度 多核处理器 突发实时任务 资源增值分析 

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