Minimizing the Worst Case Execution Time of Diagnostic Fault Queries in Real Time Systems Using Genetic Algorithm

Minimizing the Worst Case Execution Time of Diagnostic Fault Queries in Real Time Systems Using Genetic Algorithm
复制标题

使用遗传算法最小化实时系统中诊断故障查询的最坏情况执行时间

DOI:
10.1007/978-3-030-17798-0_46
复制
发表时间:
2019
期刊:
Advances in Intelligent Systems and Computing
影响因子:
--
通讯作者:
R. Obermaisser
R. Obermaisser
中科院分区:
--
文献类型:
--
作者:
N. Tabassam;S. Amin;R. Obermaisser

文献摘要

参考文献

相似文献

安全关键应用中嵌入式系统的数量不断增加。这些系统要求高水平的可靠性,并有严格的时间限制,特别是在故障发生的情况下。提高这些系统的可靠性和可用性的一种方法是引入诊断故障查询和真实的时间数据库管理系统的优化的概念。它们都可以用于将故障追溯到故障并触发适当的恢复操作。我们主要关注的是在有限的时间内完成诊断查询,以满足故障恢复(如执行器冻结)的时间约束。为此目的,重要的是提供一种解决方案,该解决方案可以以这样的方式优化诊断故障查询,即它们可以在真实的时间系统的预定义的截止期限内完成它们的执行。我们提出的算法使用遗传算法优化诊断故障查询,使这些查询的整体最坏情况执行时间(WCET)可以最小化。诊断查询以(i)左深树(LDT)和(ii)丛树(BT)的形式表示。每个查询树被转换成多个任务图,通过考虑不同的节点组合(在查询树)。我们的遗传算法选择的任务图具有最小的使跨度(调度长度),使故障诊断的目标,在规定的期限内的真实的时间系统可以实现。基于我们的结果的评估表明,诊断查询的WCET是更好的情况下,浓密树和环形拓扑结构。
The number of embedded systems in safety-critical applications are continuously increasing. These systems requires high level of reliability and have strict timing constraints specially in case of fault occurrence. One method to enhance the reliability and availability of these systems is to introduce the concept of optimization of diagnostic fault queries and real time database management systems. Both of them can be used to trace back failures to faults and trigger suitable recovery actions. Our major concern is the completion of diagnostic query in bounded time in order to satisfy timing constraints for fault recovery (e.g. actuator freezing). For this purpose it is important to provide a solution which can optimize the diagnostic fault queries in a manner that they can complete their execution within the pre-defined deadline of the real time system. Our proposed algorithm optimize the diagnostic fault queries using genetic algorithm, so that the overall Worst Case Execution Time (WCET) of these queries can be minimized. A diagnostic query is represented in the form of (i) Left Deep Tree (LDT) and (ii) Bushy Tree (BT). Each query tree is converted into multiple task graphs by considering different combinations of nodes (in query tree). Our genetic algorithm selects the task graph with minimum make span (scheduling length), so that the goal of fault diagnosis within the defined deadline of the real time system can be achieved. The evaluation based on our results shows that the WCET of the diagnostic queries is better in case of bushy trees and ring topology.
DOI: --
发表时间: 2003
期刊: EvoWorkshops
影响因子: --
作者:
Jozef J. Kratica;I. Ljubić;Dusan Tosic
通讯作者: Dusan Tosic
实时数据库的结构模型:一个例子
DOI: --
发表时间: 2008
期刊: IEEE International Symposium on Real-Time Distributed Computing
影响因子: --
作者:
Nizar Idoudi;Claude Duvallet;B. Sadeg;R. Bouaziz;F. Gargouri
通讯作者: F. Gargouri
DOI: --
发表时间: 2008
期刊: International Multi-Conference on Computing in Global Information Technology
影响因子: --
作者:
Liying Fang;Pu Wang;Jianzhuo Yan
通讯作者: Jianzhuo Yan
QScheduler:数据库系统中并行查询处理的工具
DOI: --
发表时间: 2014
期刊: IEEE International Conference on Engineering of Complex Computer Systems
影响因子: --
作者:
Qing;Shan;Jing Xu
通讯作者: Jing Xu
分布式嵌入式系统中的时间约束故障诊断:在执行器诊断中的应用
DOI: 10.1109/tpds.2005.37
发表时间: 2005
影响因子: 5.3
作者:
Nagarajan Kandasamy;J. Hayes;B. Murray
通讯作者: B. Murray