Exact Approach to the Scheduling of F-shaped Tasks with Two and Three Criticality Levels
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00311480" target="_blank" >RIV/68407700:21230/17:00311480 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/17:00311480
Result on the web
<a href="http://dx.doi.org/10.5220/0006198101600170" target="_blank" >http://dx.doi.org/10.5220/0006198101600170</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5220/0006198101600170" target="_blank" >10.5220/0006198101600170</a>
Alternative languages
Result language
angličtina
Original language name
Exact Approach to the Scheduling of F-shaped Tasks with Two and Three Criticality Levels
Original language description
The communication is an essential part of a fault tolerant and dependable system. Safety-critical systems are often implemented as time-triggered environments, where the network nodes are synchronized by clocks and follow a static schedule to ensure determinism and easy certification. The reliability of a communication bus can be further improved when the message retransmission is permitted to deal with lost messages. However, constructing static schedules for non-preemptive messages that account for retransmissions while preserving the efficient use of resources poses a challenging problem. In this paper, we show that the problem can be modeled using so-called F-shaped tasks. We propose efficient exact algorithms solving the non-preemptive message scheduling problem with retransmissions. Furthermore, we show a new complexity result, and we present computational experiments for instances with up to 200 messages.
Czech name
—
Czech description
—
Classification
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)
Result continuities
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)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems
ISBN
978-989-758-218-9
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
160-170
Publisher name
SciTePress
Place of publication
Madeira
Event location
Porto
Event date
Feb 23, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000413254200015