全局EDZL实时调度算法的可调度性判定  

Schedulability test of global EDZL real-time scheduling algorithm

作　　者：梁浩[1] 晏立[2] 沈项军[2] Liang Hao;Yan Li;Shen Xiangjun(Graduate School;School of Computer Science ＆ Telecommunication Engineering,Zhenjiang Jiangsu 212013,China)

机构地区：[1]江苏大学研究生院,江苏镇江212013 [2]江苏大学计算机科学与通信工程学院,江苏镇江212013

出　　处：《计算机应用研究》2018年第8期2347-2350,共4页Application Research of Computers

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

摘　　要：可调度性判定就是离线验证实时系统中所有任务是否可调度。通过可调度性判定,能够更好地保证实时系统的可靠性。分析在多处理器实时系统中全局EDZL算法的任务需求,考虑了带入作业和带出作业对处理器资源的需求。引入最大连续忙区间的概念,以确定带入作业的最大个数,得到了多处理器实时系统中全局EDZL算法的可调度性判定算法。通过构造大量实时任务集,对不同的判定方法进行了实验,检查通过可调度性判定的任务集数量。实验结果表明,这种方法在多处理器实时系统中是一种更为紧密的可调度性判断方法。The schedulability test is to verify whether all the tasks in the real-time system can be scheduled off-line.It can better guarantee the reliability of real-time system through the schedulability test.This paper considered the processor resource demands of the carry-in jobs and the carry-out jobs based on the requirement analysis of the global EDZL algorithm in the multiprocessor real-time system.It introduced the concept of maximal continuous busy interval to determine the maximum number of the carry-in jobs,and presented the schedulability test algorithm of global EDZL algorithm.By constructing a large number of real-time task sets,it carried out experiments on different test methods,and checked the number of task sets that can be passed by schedulability test.Experimental results show that this method is a more close schedulability test method in multiprocessor real-time system.

关 键 词：实时系统 多处理器 全局EDZL算法 可调度性判定 最大连续忙区间 

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