Frame Packing Algorithms for Automotive Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Frame Packing Algorithms for Automotive Applications

Rishi Saket
  • Function : Author
Nicolas Navet
  • Function : Author
  • PersonId : 755790
  • IdRef : 096306831


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4998.pdf (249.46 Ko) Télécharger le fichier

Dates and versions

inria-00077036 , version 1 (29-05-2006)


  • HAL Id : inria-00077036 , version 1


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


Gmail Facebook Twitter LinkedIn More