The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Le développement du réseau de zone de contrôle (CAN) a commencé en 1983 et se poursuit aujourd'hui. Les prévisions de production mondiale annuelle pour 2008 sont d'environ 65 à 67 millions de véhicules avec en moyenne 10 à 15 nœuds CAN par véhicule. Bien que le réseau CAN soit efficace dans le contrôle automobile et industriel parce qu'il fournit des messages à faible coût, haute fiabilité et priorité, un problème de famine existe dans le réseau car le réseau est conçu pour utiliser un mécanisme de priorité fixe. Cet article présente un schéma d'inversion des priorités, appartenant à un mécanisme de priorité dynamique pour prévenir le problème de la famine. Le schéma proposé utilise un bit pour séparer tous les messages en deux catégories avec/sans priorité inversée. Un modèle d'analyse est également construit dans cet article. D'après le modèle, un message avec priorité inversée a une priorité à traiter plus élevée que les messages sans priorité inversée donc son temps d'attente moyen est plus court que les autres. Deux cas avec et sans inversion sont implémentés dans nos expériences en utilisant un outil de vérification de modèle probabiliste basé sur une technique de vérification formelle automatique. Les résultats numériques démontrent que les messages de faible priorité avec inversion de priorité ont une meilleure expression de la probabilité dans un état de file d'attente pleine que les autres sans inversion. Cependant, notre schéma est très simple et efficace et peut être facilement implémenté au niveau de la puce.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Cheng-Min LIN, "Analysis and Modeling of a Priority Inversion Scheme for Starvation Free Controller Area Networks" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 6, pp. 1504-1511, June 2010, doi: 10.1587/transinf.E93.D.1504.
Abstract: Control Area Network (CAN) development began in 1983 and continues today. The forecast for annual world production in 2008 is approximately 65-67 million vehicles with 10-15 CAN nodes per vehicle on average . Although the CAN network is successful in automobile and industry control because the network provides low cost, high reliability, and priority messages, a starvation problem exists in the network because the network is designed to use a fixed priority mechanism. This paper presents a priority inversion scheme, belonging to a dynamic priority mechanism to prevent the starvation problem. The proposed scheme uses one bit to separate all messages into two categories with/without inverted priority. An analysis model is also constructed in this paper. From the model, a message with inverted priority has a higher priority to be processed than messages without inverted priority so its mean waiting time is shorter than the others. Two cases with and without inversion are implemented in our experiments using a probabilistic model checking tool based on an automatic formal verification technique. Numerical results demonstrate that low-priority messages with priority inversion have better expression in the probability in a full queue state than others without inversion. However, our scheme is very simple and efficient and can be easily implemented at the chip level.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1504/_p
Copier
@ARTICLE{e93-d_6_1504,
author={Cheng-Min LIN, },
journal={IEICE TRANSACTIONS on Information},
title={Analysis and Modeling of a Priority Inversion Scheme for Starvation Free Controller Area Networks},
year={2010},
volume={E93-D},
number={6},
pages={1504-1511},
abstract={Control Area Network (CAN) development began in 1983 and continues today. The forecast for annual world production in 2008 is approximately 65-67 million vehicles with 10-15 CAN nodes per vehicle on average . Although the CAN network is successful in automobile and industry control because the network provides low cost, high reliability, and priority messages, a starvation problem exists in the network because the network is designed to use a fixed priority mechanism. This paper presents a priority inversion scheme, belonging to a dynamic priority mechanism to prevent the starvation problem. The proposed scheme uses one bit to separate all messages into two categories with/without inverted priority. An analysis model is also constructed in this paper. From the model, a message with inverted priority has a higher priority to be processed than messages without inverted priority so its mean waiting time is shorter than the others. Two cases with and without inversion are implemented in our experiments using a probabilistic model checking tool based on an automatic formal verification technique. Numerical results demonstrate that low-priority messages with priority inversion have better expression in the probability in a full queue state than others without inversion. However, our scheme is very simple and efficient and can be easily implemented at the chip level.},
keywords={},
doi={10.1587/transinf.E93.D.1504},
ISSN={1745-1361},
month={June},}
Copier
TY - JOUR
TI - Analysis and Modeling of a Priority Inversion Scheme for Starvation Free Controller Area Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1504
EP - 1511
AU - Cheng-Min LIN
PY - 2010
DO - 10.1587/transinf.E93.D.1504
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2010
AB - Control Area Network (CAN) development began in 1983 and continues today. The forecast for annual world production in 2008 is approximately 65-67 million vehicles with 10-15 CAN nodes per vehicle on average . Although the CAN network is successful in automobile and industry control because the network provides low cost, high reliability, and priority messages, a starvation problem exists in the network because the network is designed to use a fixed priority mechanism. This paper presents a priority inversion scheme, belonging to a dynamic priority mechanism to prevent the starvation problem. The proposed scheme uses one bit to separate all messages into two categories with/without inverted priority. An analysis model is also constructed in this paper. From the model, a message with inverted priority has a higher priority to be processed than messages without inverted priority so its mean waiting time is shorter than the others. Two cases with and without inversion are implemented in our experiments using a probabilistic model checking tool based on an automatic formal verification technique. Numerical results demonstrate that low-priority messages with priority inversion have better expression in the probability in a full queue state than others without inversion. However, our scheme is very simple and efficient and can be easily implemented at the chip level.
ER -