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

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/68407700:21730/17:00312553

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA16-23509S" target="_blank" >GA16-23509S: Flexibilní rozvrhovací a optimalizační algoritmy pro distribuované systémy reálného času</a><br>

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-1-5090-5788-7

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

1-9

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Trondheim

Datum konání akce

31. 5. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—