Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling
Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling
复制标题
DOI：
--
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
L. George;N. Rivierre;M. Spuri
中科院分区：
文献类型：
--
作者：
L. George;N. Rivierre;M. Spuri
安排理论适用于艰难的时间环境，在过去的二十年中已经广泛研究了，可能尚不清楚在可用的大量结果中列出它。我们的目标是首先在一篇论文中收集以单质量SOR，非尺度，先发制人/非首领，固定/动态优先级驱动的上下文而闻名的结果，将一般任务集视为可能处理器负载描述的中心数字。第二，在需要时建立新的结果。特别是，在很大程度上利用工作量，处理器需求和繁忙时期的概念来检查最佳性，可行性条件和最坏情况响应时间。还考虑了一些经典的扩展，例如抖动，资源共享。尽管这项工作并不是针对这些结果的正式比较，但似乎先发制人和非抢先的调度密切相关，并且可以根据更高优先级繁忙时期的概念来统一固定与动态调度的分析。特别是，我们介绍了EDF Sched Ules的截止日期繁忙期的概念，我们猜想是I级繁忙时期的有趣相似之处，这是一个已经用于分析固定优先级驱动的调度的概念。
Scheduling theory, as it applies to hard-real-time environment, has been widely studied in the last twenty years and it might be unclear to make it out within the plethora of results available. Our goal is first to collect in a single paper the results known for uniproces sor, non-idling, preemptive/non-preemptive, fixed/dynamic priority driven contexts, consid ering general task sets as a central figure for the description of possible processor loads. Second to establish new results when needed. In particular, optimality, feasibility conditions and worst-case response times are examined largely by utilizing the concepts of workload, processor demand and busy period. Some classic extensions such as jitter, resource sharing are also considered. Although this work is not oriented toward a formal comparison of these results, it appears that preemptive and non-preemptive scheduling are closely related and that the analysis of fixed versus dynamic scheduling might be unified according to the concept of higher priority busy period. In particular, we introduce the notion of deadline-d busy period for EDF sched ules, that we conjecture to be an interesting parallel of the level-i busy period, a concept already used in the analysis of fixed priority driven scheduling.