Frame packing algorithms for automotive applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Embedded Computing Year : 2006

Frame packing algorithms for automotive applications


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.
Fichier principal
Vignette du fichier
JEC_RSNN.pdf (241.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00105925 , version 1 (28-08-2007)


  • HAL Id : inria-00105925 , version 1


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


Gmail Facebook Twitter LinkedIn More