This paper addresses the problem of scheduling non-preemptive tasks with release jitter and execution time variation on a uniprocessor. We show that the schedulability analysis based on schedule graph generation, proposed by Nasri and Brandenburg [RTSS 2017], produces negative results when it could be easily avoided by slightly reformalizing the notion of non-work-conserving policies. In this work, we develop a schedulability analysis that constructs the schedule graph using new job-eligibility rules and is exact and sustainable for both work-conserving and enhanced formalization of non-work-conserving policies. Besides, the experimental evaluation shows that our schedulability analysis is substantially faster.

翻译：本文研究了在单处理器上调度具有释放抖动和执行时间变化的非抢占式任务的问题。我们指出，由Nasri和Brandenburg [RTSS 2017]提出的基于调度图生成的可调度性分析方法，在可以通过对非工作保持策略的概念进行轻微重新形式化而轻易避免的情况下，会产生负面结果。在本工作中，我们开发了一种可调度性分析方法，该方法使用新的作业资格规则构建调度图，并且对于工作保持策略以及经过增强形式化的非工作保持策略都是精确且可持续的。此外，实验评估表明，我们的可调度性分析速度显著更快。