Title
Schedulability Analysis And Message Schedule Computation For The Dynamic Segment Of Flexray
Abstract
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.
Year
DOI
Venue
2010
10.1109/VETECF.2010.5594414
2010 IEEE 72ND VEHICULAR TECHNOLOGY CONFERENCE FALL
Keywords
Field
DocType
protocols,linear programming,schedules,vehicle dynamics,real time,message passing,dynamic scheduling,real time systems,scheduling,heuristic algorithm,integer programming,mobile computing
FlexRay,Heuristic (computer science),Computer science,Scheduling (computing),Parallel computing,Real-time computing,Integer programming,Schedule,Linear programming,Dynamic priority scheduling,Message passing
Conference
ISSN
Citations 
PageRank 
1550-2252
13
0.87
References 
Authors
3
2
Name
Order
Citations
PageRank
Klaus Schmidt1130.87
Ece Guran Schmidt214616.27