ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. JIP
  2. Vol.20
  3. No.2

The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages

https://ipsj.ixsq.nii.ac.jp/records/81807
https://ipsj.ixsq.nii.ac.jp/records/81807
b100de4b-5097-47a6-ad01-2d22e768c4ae
名前 / ファイル ライセンス アクション
IPSJ-JIP2002013.pdf IPSJ-JIP2002013.pdf (1.1 MB)
Copyright (c) 2012 by the Information Processing Society of Japan
オープンアクセス
Item type JInfP(1)
公開日 2012-04-15
タイトル
タイトル The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages
タイトル
言語 en
タイトル The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages
言語
言語 eng
キーワード
主題Scheme Other
主題 [Regular Paper] CAN, WCRT analysis, offset, FIFO queue
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Department of Information Engineering, Graduate School of Information Science, Nagoya University
著者所属
Center for Embedded Computing Systems, Graduate School of Information Science, Nagoya University
著者所属
Graduate School of Engineering, Nagoya University
著者所属
Department of Information Engineering, Graduate School of Information Science, Nagoya University
著者所属(英)
en
Department of Information Engineering, Graduate School of Information Science, Nagoya University
著者所属(英)
en
Center for Embedded Computing Systems, Graduate School of Information Science, Nagoya University
著者所属(英)
en
Graduate School of Engineering, Nagoya University
著者所属(英)
en
Department of Information Engineering, Graduate School of Information Science, Nagoya University
著者名 Yang, Chen Ryo, Kurachi Gang, Zeng Hiroaki, Takada

× Yang, Chen Ryo, Kurachi Gang, Zeng Hiroaki, Takada

Yang, Chen
Ryo, Kurachi
Gang, Zeng
Hiroaki, Takada

Search repository
著者名(英) Yang, Chen Ryo, Kurachi Gang, Zeng Hiroaki, Takada

× Yang, Chen Ryo, Kurachi Gang, Zeng Hiroaki, Takada

en Yang, Chen
Ryo, Kurachi
Gang, Zeng
Hiroaki, Takada

Search repository
論文抄録
内容記述タイプ Other
内容記述 The Controller Area Network (CAN) is widely employed in automotive control system networks. In the last few years, the amount of data has been increasing rapidly in these networks. With the purpose of improving CAN bandwidth efficiency, scheduling and analysis are considered to be particularly important. As an effective method, it has been known that assigning offsets to the CAN messages can reduce their worst case response time (WCRT). Meanwhile, the fact is that many commercial CAN controllers have been equipped with a priority or first-in-first-out (FIFO) queue to transmit messages to the CAN bus. However, previous researches for WCRT analysis of CAN messages either assumed a priority queue or did not consider the offset. For this reason, in this paper we propose a WCRT analysis method for CAN messages with assigned offset in the FIFO queue. We first present a critical instant theorem, then we propose two algorithms for WCRT calculation based on the given theorem. Experimental results on generated message sets and a real message set have validated the effectiveness of the proposed algorithms.
論文抄録(英)
内容記述タイプ Other
内容記述 The Controller Area Network (CAN) is widely employed in automotive control system networks. In the last few years, the amount of data has been increasing rapidly in these networks. With the purpose of improving CAN bandwidth efficiency, scheduling and analysis are considered to be particularly important. As an effective method, it has been known that assigning offsets to the CAN messages can reduce their worst case response time (WCRT). Meanwhile, the fact is that many commercial CAN controllers have been equipped with a priority or first-in-first-out (FIFO) queue to transmit messages to the CAN bus. However, previous researches for WCRT analysis of CAN messages either assumed a priority queue or did not consider the offset. For this reason, in this paper we propose a WCRT analysis method for CAN messages with assigned offset in the FIFO queue. We first present a critical instant theorem, then we propose two algorithms for WCRT calculation based on the given theorem. Experimental results on generated message sets and a real message set have validated the effectiveness of the proposed algorithms.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA00700121
書誌情報 Journal of information processing

巻 20, 号 2, p. 451-462, 発行日 2012-04-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-6652
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-21 19:16:30.224490
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3