Frame packing algorithms for automotive applications

Rishi Saket (1) , Nicolas Navet (2)

1 Georgia Institute of Technology [Atlanta]
2 TRIO - Real time and interoperability

The set of frames exchanged in automotive 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 minimize the bandwidth usage. This study presents novel algorithms for building bandwidth-minimizing sets of frames that meet the schedulability requirement. In our experiments, these proposals have proved to be more effective than the existing approaches.

Mots clés: Embedded systems; scheduling algorithms; controller area network; heuristics; bandwidth-minimization problems

Domaines: Algorithme et structure de données [cs.DS]; Systèmes embarqués; Réseaux et télécommunications [cs.NI]

Rishi Saket, Nicolas Navet. Frame packing algorithms for automotive applications. Journal of Embedded Computing, 2006, 2, pp.93-102. ⟨inria-00105925⟩