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
O desenvolvimento da Rede de Área de Controle (CAN) começou em 1983 e continua até hoje. A previsão para a produção mundial anual em 2008 é de aproximadamente 65-67 milhões de veículos com 10-15 nós CAN por veículo, em média. Embora a rede CAN seja bem-sucedida no controle automotivo e industrial porque fornece mensagens de baixo custo, alta confiabilidade e prioridade, existe um problema de falta de energia na rede porque a rede é projetada para usar um mecanismo de prioridade fixa. Este artigo apresenta um esquema de inversão de prioridades, pertencente a um mecanismo de prioridade dinâmico para prevenir o problema da fome. O esquema proposto utiliza um bit para separar todas as mensagens em duas categorias com/sem prioridade invertida. Um modelo de análise também é construído neste artigo. Pelo modelo, uma mensagem com prioridade invertida tem maior prioridade de processamento do que mensagens sem prioridade invertida, portanto seu tempo médio de espera é menor que as demais. Dois casos com e sem inversão são implementados em nossos experimentos utilizando uma ferramenta de verificação de modelo probabilístico baseada em uma técnica de verificação formal automática. Os resultados numéricos demonstram que mensagens de baixa prioridade com inversão de prioridade têm melhor expressão na probabilidade em estado de fila cheia do que outras sem inversão. No entanto, nosso esquema é muito simples e eficiente e pode ser facilmente implementado no nível do chip.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -