两种新型实时调度算法的研究与实现  

Research and Implementation of Two New Real-time Scheduling Algorithms

作　　者：施佳丽 Shi Jiali(Department of Information Engineering,Sichuan College of Architectural Technology,Deyang Sichuan 618000,China)

机构地区：[1]四川建筑职业技术学院信息工程系,四川德阳618000

出　　处：《信息与电脑》2017年第22期46-48,共3页Information & Computer

摘　　要：笔者在维持实时数据一致性的基础上提出了采用周期性事务模型的More-Less算法和采用偶发事务模型的可推迟调度DS-FP算法,并详细分析了这两个算法的约束条件和执行过程。最后,在仿真环境中实现了ML和DS-FP算法的调度过程,并对它们的可调度性和系统性能进行了分析比较。研究结果表明,DS-FP算法比ML算法具有更好的系统性能和可调度性。Based on the consistency of real-time data,the author proposes a deferred scheduling DS-FP algorithm using the More-Less algorithm and the transaction model of the periodic transaction model,and analyzes the constraints and execution of the two algorithms in detail process.Finally,the scheduling process of ML and DS-FP algorithm is realized in the simulation envi ronment,and their schedulability and system performance are analyzed and compared.The results show that the DS-FP algorithm has better system performance and schedulability than ML algorithm.

关 键 词：实时调度 More-Less 可推迟调度 相对时限 

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