Worst-case response time analysis for partitioned fixed-priority DAG tasks on identical processors
Worst-case response time analysis for partitioned fixed-priority DAG tasks on identical processors
复制标题
相同处理器上分区固定优先级 DAG 任务的最坏情况响应时间分析
DOI：
10.1109/etfa.2019.8869147
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Dorin Maxim
中科院分区：
文献类型：
--
作者：
Slim Ben;L. Cucu;Dorin Maxim
新功能的不断集成增加了嵌入式系统的复杂性，而每个功能可能会在实现它的程序之间施加优先约束。此外，几个处理器的流行可能会造成计算能力更高的错觉，从而缓解相关的调度问题。然而，这种能力在关键的实时系统中是不可利用的，因为执行时间的可变性增加了，这是因为处理器功能被设计成提供出色的平均时间行为，并且不一定确保较小的最坏情况界限。当系统构建在几个处理器之上时，这一困难增加了调度异常的存在。本文研究了在相同处理器上按抢占式固定优先级分区策略调度独立任务的可行性。根据有向无环图(DAG)，每个任务由几个相互依赖的子任务组成，子任务之间相互关联。当每个子任务具有各自的优先级时，我们提供了DAG任务的最坏情况响应时间分析。这一假设允许减少可能的执行场景的数量，使我们的分析更容易，不那么悲观。
The continuous integration of new functionality increases the complexity of embedded systems, while each functionality might impose precedence constraints between the programs fulfilling it. In addition, the prevalence of several processors may create the illusion of higher computation capacity easing the associated scheduling problem. However, this capacity is not exploitable in critical real time systems because of the increased variability of the execution times due to processor features designed to provide excellent average time behaviour and not necessarily ensuring small worst case bounds. This difficulty is added to the existence of scheduling anomalies when the systems are built on top of several processors. In this paper, we study the feasibility of independent tasks scheduled according to a given preemptive fixed-priority partitioned policy on identical processors. Each task is composed of several dependent subtasks related between them according to a directed acyclic graph (DAG). We provide a worst case response time analysis for DAG tasks when each sub-tasks have an individual priority level. This assumption allows to decrease the number of possible execution scenarios, making our analysis easier and less pessimistic.
影响因子：
16.6
作者：
Davis, Robert I.;Burns, Alan
通讯作者：
Burns, Alan