Hide/Show Apps

Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay

Schmidt, Şenan Ece
In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.