Skip to Main content Skip to Navigation
Journal articles

Frame packing algorithms for automotive applications

Rishi Saket 1 Nicolas Navet 2
2 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadata
Contributor : Nicolas Navet <>
Submitted on : Tuesday, August 28, 2007 - 12:48:39 PM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:32:39 PM


Files produced by the author(s)


  • HAL Id : inria-00105925, version 1



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



Record views


Files downloads