• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on industrial informatics >Robust Priority Assignments for Extending Existing Controller Area Network Applications
【24h】

Robust Priority Assignments for Extending Existing Controller Area Network Applications

机译：扩展现有控制器局域网应用的可靠优先级分配

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by new messages. In this case, a feasible priority order that retains the standardized IDs of the existing messages and assigns suitable priorities to the new messages needs to be found. This paper proposes an algorithm for the computation of robust priority orders that solves the stated problem of extending existing message sets. First, bounds for the priorities of new messages are determined and then the most robust priority order that keeps the IDs of the existing messages is computed. The obtained algorithms are proved to yield correct results and are illustrated by detailed scheduling examples.
机译：控制器局域网（CAN）作为车载通信总线的使用要求找到可行且健壮的优先级顺序，以使在总线上传输的每个消息都符合其指定的期限，并容忍潜在的传输错误。尽管此类优先级顺序可以通过可用的算法随时确定，但是始终假定CAN优先级顺序是从头开始计算的。在实际应用中，经常需要用新消息扩展现有消息集。在这种情况下，需要找到一个可行的优先级顺序，该顺序保留现有消息的标准化ID，并为新消息分配合适的优先级。本文提出了一种用于计算鲁棒优先级的算法，该算法解决了扩展现有消息集的问题。首先，确定新消息优先级的界限，然后计算保留现有消息ID的最可靠的优先级顺序。证明所获得的算法产生正确的结果，并通过详细的调度示例进行说明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号