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

可调度性判定就是离线验证实时系统中所有任务是否可调度。通过可调度性判定，能够更好地保证实时系统的可靠性。有多种分析方法可用于可调度性判定，得到的结果有所不同。通过分析在多处理器实时系统中全局EDZL算法的任务需求，考虑带入作业和带出作业对处理器资源的需求。引入最大连续忙区间的概念，以确定带入作业的最大个数，得到了多处理器实时系统中全局EDZL算法的可调度性判定算法。实验结果说明了这种方法提高了通过可调度性判定的任务数量，是一种更紧密的可调度性判断方法。

Schedulability Test of Global EDZL Real-time Scheduling Algorithm

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. A variety of analytical methods can be used for schedulability test, and the results obtained are different. The processor resource demands of the carry-in jobs and the carry-out jobs are considered based on the requirement analysis of the global EDZL algorithm in the multiprocessor real-time system. The concept of maximal continuous busy interval is introduced to determine the maximum number of the carry-in jobs, and the schedulability test algorithm of global EDZL algorithm is presented. The experiment results show that the proposed method can improve the number of tasks that can be passed by schedulability test, and is a more efficient method.