Response-Time Analysis for Task Chains with Complex Precedence and Blocking Relations
Response-Time Analysis for Task Chains with Complex Precedence and Blocking Relations
复制标题
DOI：
10.1145/3126505
复制
发表时间：
2017-09
期刊：
影响因子：
--
通讯作者：
Johannes Schlatow;R. Ernst
中科院分区：
文献类型：
--
作者：
Johannes Schlatow;R. Ernst
对于复杂软件系统的开发，我们经常求助于基于组件的方法，这些方法分离了不同的关注点，增强了可验证性和可重用性，并且基于微内核的实现非常适合执行这些概念。然而，将这样一个由几个相互作用的软件组件组成的系统将导致复杂的优先级和阻塞关系，在执行延迟分析时必须考虑到这一点。当通过经典任务图对这些系统建模时，其中一些效果会被混淆，并倾向于使这样的分析过于悲观甚至乐观。因此，我们首先提出了一个新的任务（元）模型，该模型在这些（功能）优先级和相互阻塞关系的基础上更具表达性和准确性。其次，我们应用忙碌窗口方法，在任务链层面提出了一个适合但不限于静态优先级调度系统的模块化响应时间分析方法。我们表明，这两个概念的结合允许为相关工作未充分涵盖的场景计算合理的严格延迟界限。
For the development of complex software systems, we often resort to component-based approaches that separate the different concerns, enhance verifiability and reusability, and for which microkernel-based implementations are a good fit to enforce these concepts. Composing such a system of several interacting software components will, however, lead to complex precedence and blocking relations, which must be taken into account when performing latency analysis. When modelling these systems by classical task graphs, some of these effects are obfuscated and tend to render such an analysis either overly pessimistic or even optimistic. We therefore firstly present a novel task (meta-)model that is more expressive and accurate w.r.t. these (functional) precedence and mutual blocking relations. Secondly, we apply the busy-window approach and formulate a modular response-time analysis on task-chain level suitable but not restricted to static-priority scheduled systems. We show that the conjunction of both concepts allows the calculation of reasonably tight latency bounds for scenarios not adequately covered by related work.