Tolerating Transient Communication Faults with Online Traffic Scheduling

被引:0
|
作者
Marques, Luis
Vasconcelos, Veronica
Pedreiras, Paulo
Almeida, Luis
机构
关键词
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Building distributed embedded systems that will be fault-free for all their lifetime is virtually impossible, thus the systems must deal with them if a continued correct behavior is needed. This is the case of safety-critical systems, such as X-by-wire systems in the automotive domain. Concerning transient communication faults in particular, they can be dealt with at various levels of the protocol stacks, with different techniques, e. g., temporal and spatial redundancy. In this paper we focus on temporal redundancy and we address the limitations imposed by typical time-triggered systems, commonly found in safety-critical systems, arising from their static traffic definition. In these systems the use of temporal redundancy to handle communication errors requires the pre-allocation of communication resources that, in the absence of errors, are wasted. Therefore, we propose an online traffic scheduling approach in which retransmissions are consistently scheduled with the remaining time-triggered traffic, using the unique flexibility provided by the FTT-CAN protocol (Flexible Time-Triggered communication on CAN). We address the integration of appropriate fault detectors in the FTT-CAN protocol to monitor the bus activity and re-schedule omitted messages. We show that this approach is more efficient than the static allocations, since communication resources are only allocated when necessary. We also discuss alternative realizations and validate the approach with initial results from a prototype implementation.
引用
收藏
页码:396 / 402
页数:7
相关论文
共 50 条
  • [21] Sparse networks tolerating random faults
    Yamada, T
    Ueno, S
    FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 114 - 118
  • [22] Tolerating Corrupted Communication
    Biely, Martin
    Charron-Bost, Bernadette
    Gaillard, Antoine
    Hutle, Martin
    Schiper, Andre
    Widder, Josef
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 244 - 253
  • [23] TOLERATING TRANSIENT AND PERMANENT FAILURES
    ANAGNOSTOU, E
    HADZILACOS, V
    DISTRIBUTED ALGORITHMS, 1993, 725 : 174 - 188
  • [24] Tolerating transient and intermittent failures
    Delaët, S
    Tixeuil, S
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (05) : 961 - 981
  • [25] Tolerating hard faults in microprocessor array structures
    Bower, FA
    Shealy, PG
    Ozev, S
    Sorin, DJ
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 51 - 60
  • [26] TOLERATING FAULTS IN A MESH WITH A ROW OF SPARE NODES
    BRUCK, J
    CYPHER, R
    HO, CT
    THEORETICAL COMPUTER SCIENCE, 1994, 128 (1-2) : 241 - 252
  • [27] RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS
    Yamauchi, Yukiko
    Bein, Doina
    Masuzawa, Toshimitsu
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (05) : 1099 - 1122
  • [28] Reliable Communication on Emulated Channels Resilient to Transient Faults
    Bein, Doina
    Masuzawa, Toshimitsu
    Yamauchi, Yukiko
    2009 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES (PDCAT 2009), 2009, : 366 - +
  • [29] TOLERATING FAULTS IN HYPERCUBES USING SUBCUBE PARTITIONING
    BRUCK, J
    CYPHER, R
    SOROKER, D
    IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (05) : 599 - 605
  • [30] Methodologies for tolerating cell and interconnect faults in FPGAs
    Hanchek, F
    Dutt, S
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (01) : 15 - 33