单处理器平台下的严格周期任务可调度性判定  

Schedulability Test for Strictly Periodic Tasks on Uniprocessor Platform

作　　者：陈进朝[1] 杜承烈[1] 

机构地区：[1]西北工业大学计算机学院,西安710129

出　　处：《计算机工程》2016年第5期288-291,共4页Computer Engineering

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

摘　　要：针对系统调度理论研究中的严格周期任务可调度性判定问题,从研究实时系统中严格周期任务之间的相互干涉关系出发,提出一种基于特征任务的可调度性判定方法。分析严格周期任务在单一处理器平台下无冲突运行的时间约束,计算任务所能使用的全部空余时间,进而界定连续空余时间是否满足任务执行的需要,得到一个可调度性判定的充要条件。实验结果表明,与特征映射任务分配方法相比,该方法能够减少判定时间,提高判定成功率,具有更优的可调度判定性能。Aiming at the problem of schedulability test for strictly perloulc tasks -~ t.~ scheduling,this paper researches the interference relationship between strictly periodic tasks in a real-time system, and presents an eigentask-based schedulability test method. It analyzes the time constraints of strictly periodic tasks running on a uniprocessor platform,calculates all free time, and provides a sufficient and necessary schedulability test condition by determining whether enough continuous free time is available for the task＇ s execution. Experimental results show that, compared with Eigen-mapping Task Assignment（EMTA） method,the proposed method can reduce the time consumption required for the test and improve the success ratio. It has better schedulability test performance.

关 键 词：严格周期任务 可调度性判定 单处理器 特征任务 实时系统 空余时间 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论]