Scheduling of safety-critical time-constrained traffic with F-shaped messages

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00312553" target="_blank" >RIV/68407700:21230/17:00312553 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21730/17:00312553

Result on the web

<a href="http://dx.doi.org/10.1109/WFCS.2017.7991948" target="_blank" >http://dx.doi.org/10.1109/WFCS.2017.7991948</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/WFCS.2017.7991948" target="_blank" >10.1109/WFCS.2017.7991948</a>

Result language

angličtina

Original language name

Scheduling of safety-critical time-constrained traffic with F-shaped messages

Original language description

The rapid improvement of systems that surround us such as automotive vehicles brings new challenges for system designers and manufacturers. New functionalities like advanced driver assistants leverage some responsibilities from the driver to an autonomous system. Being able to provide such functionalities requires a safety certification for the system, namely the reliability of the communication backbone. In complex systems, the safety certification is becoming a hard problem, especially in Event-Triggered environments. On the other hand, Time-Triggered communications are well-known for their determinism, reliability, and ease of certification but lack the flexibility that is required e.g. for message retransmissions. To support safety-critical applications, we improve the reliability of Time-Triggered communications even more. We build schedules that account for retransmissions of lost messages. The schedules are robust and static while encapsulating all the possible alternative execution scenarios arising from the uncertainty of transmission outcomes. However, being too robust can be very costly. Therefore, our schedules compensate retransmissions by a possibility of rejecting the transmission of less critical messages to achieve a trade-off between the safety and efficient usage of resources. To solve this complex problem, we present a novel two-stage decomposition algorithm for the synthesis of static schedules accounting for alternative execution scenarios with non-preemptive messages that are constrained by release times and deadlines. We show that our method attains solutions within 6–7% from a lower bound even for large problem instances.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 13th International Workshop on Factory Communication Systems (WFCS)

ISBN

978-1-5090-5788-7

ISSN

—

e-ISSN

—

Number of pages

9

Pages from-to

1-9

Publisher name

IEEE

Place of publication

Piscataway

Event location

Trondheim

Event date

May 31, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—