Frame Packing Algorithms for Automotive Applications
Résumé
The set of frames exchanged in an in-vehicle applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandwidth consumption. This latter point is important since it allows the use of low cost electronic components and it facilitates an incremental design process. The purpose of this study is to propose efficient algorithms for solving the NP-hard problem of generating a set of schedulable frames that minimizes the bandwidth usage. This study presents two algorithms: one for building the set of frames while the other aims at finding a feasible set of frames starting from an unfeasible one. On our experiments, these proposals have proved to be more effective than the existing approaches.