Authors:
Antonin Novak
;
Premysl Sucha
and
Zdenek Hanzalek
Affiliation:
Czech Technical University in Prague, Czech Republic
Keyword(s):
Scheduling, Mixed-criticality, Embedded Systems, Integer Linear Programming.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Industrial Engineering
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Mathematical Modeling
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Pattern Recognition
;
Scheduling
;
Software Engineering
;
Symbolic Systems
Abstract:
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.