Skip to Main content Skip to Navigation

Frame Packing Algorithms for Automotive Applications

Rishi Saket Nicolas Navet 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:57:42 AM
Last modification on : Friday, February 4, 2022 - 3:31:54 AM
Long-term archiving on: : Monday, April 5, 2010 - 9:02:01 PM


  • HAL Id : inria-00077036, version 1



Rishi Saket, Nicolas Navet. Frame Packing Algorithms for Automotive Applications. [Research Report] RR-4998, INRIA. 2003. ⟨inria-00077036⟩



Record views


Files downloads