{"links":{},"id":81307,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00081307","sets":["581:6644:6728"]},"path":["6728"],"owner":"11","recid":"81307","title":["The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-03-15"},"_buckets":{"deposit":"f9640614-7fcc-439b-bdad-8a064ebb802f"},"_deposit":{"id":"81307","pid":{"type":"depid","value":"81307","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages","author_link":["357776","357778","357780","357775","357779","357774","357773","357777"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages"},{"subitem_title":"The Worst-Case Response Time Analysis for FIFO-based Offset Assigned CAN Messages","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Information Engineering, Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Center for Embedded Computing Systems, Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"Graduate School of Engineering, Nagoya University"},{"subitem_text_value":"Department of Information Engineering, Graduate School of Information Science, Nagoya University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Engineering, Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Center for Embedded Computing Systems, Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering, Graduate School of Information Science, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/81307/files/IPSJ-JNL5303031.pdf","label":"IPSJ-JNL5303031"},"date":[{"dateType":"Available","dateValue":"2014-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5303031.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a02babcd-96c3-4b8a-b599-f367ba4b15d3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yang, Chen"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Kurachi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gang, Zeng"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroaki, Takada"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yang, Chen","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Kurachi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gang, Zeng","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroaki, Takada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.451\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.451\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:35:33.751390+00:00","updated":"2025-01-20T06:52:02.597189+00:00"}