Mixed-criticality scheduling of messages in time-triggered protocols

In different communication protocols, a message retransmission is often used to increase reliability. Messages with higher criticality are allowed for more retransmissions and therefore different execution time values should be specified for each criticality level of the given message. The paper deals with a problem of the static scheduling of mixed-criticality messages on a communication resource (collision domain) without preemption. On the basis of the current state of the art in the mixed-criticality scheduling, our problem, denoted as 1|r_i, d_i, mc =L|βC_max + αΣT, is formulated. We use two metaheuristic methods used to solve the mixed-criticality scheduling problem.