Frame Packing Algorithms for Automotive Applications
Identifieur interne : 007646 ( Main/Exploration ); précédent : 007645; suivant : 007647Frame Packing Algorithms for Automotive Applications
Auteurs : Rishi Saket ; Nicolas NavetSource :
English descriptors
- KwdEn :
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.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003B26
- to stream Crin, to step Curation: 003B26
- to stream Crin, to step Checkpoint: 000B77
- to stream Main, to step Merge: 007A24
- to stream Main, to step Curation: 007646
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="352">Frame Packing Algorithms for Automotive Applications</title></titleStmt><publicationStmt><idno type="RBID">CRIN:saket03a</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003B26</idno><idno type="wicri:Area/Crin/Curation">003B26</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003B26</idno><idno type="wicri:Area/Crin/Checkpoint">000B77</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000B77</idno><idno type="wicri:Area/Main/Merge">007A24</idno><idno type="wicri:Area/Main/Curation">007646</idno><idno type="wicri:Area/Main/Exploration">007646</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Frame Packing Algorithms for Automotive Applications</title><author><name sortKey="Saket, Rishi" sort="Saket, Rishi" uniqKey="Saket R" first="Rishi" last="Saket">Rishi Saket</name></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>bandwidth.</term><term>embedded systems</term><term>heuristics</term><term>scheduling</term><term>vehicles</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2298">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.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name><name sortKey="Saket, Rishi" sort="Saket, Rishi" uniqKey="Saket R" first="Rishi" last="Saket">Rishi Saket</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007646 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007646 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:saket03a
|texte= Frame Packing Algorithms for Automotive Applications
}}
| This area was generated with Dilib version V0.6.33. |  |