Frame packing algorithms for automotive applications

Authors:
Rishi Saket;Nicolas Navet
Affiliations:
Georgia Institute of Technology, College of Computing, Atlanta GA 30332, USA. E-mail: Rishi.Saket@cc.gatech.edu;(Correspd. N. Navet, Tel.: +33 3 54958463/ Fax: +33 3 54958401/ E-mail: nnavet@loria.fr) Loria - Inria, Campus Scientifique - BP 236, 54506 Vandoeuvre-lè/s-Nancy, France
Venue:
Journal of Embedded Computing - Embeded Processors and Systems: Architectural Issues and Solutions for Emerging Applications
Year:
2006

Citing 7
Cited 3

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Worst-case deadline failure probability in real-time applications distributed over controller area network

Journal of Systems Architecture: the EUROMICRO Journal
Investigation of Different Seeding Strategies in a Genetic Planner

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Schedulability-driven frame packing for multi-cluster distributed embedded systems

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Frame packing in real-time communication

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Enhanced fixed-priority scheduling with (m,k)-firm guarantee

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

FlexRay schedule optimization of the static segment

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Reliability-aware frame packing for the static segment of flexray

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Optimization of task allocation and priority assignment in hard real-time distributed systems

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

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.