{"updated":"2025-01-22T00:11:46.668780+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00068430","sets":["934:1119:6067:6068"]},"path":["6068"],"owner":"10","recid":"68430","title":["高い移植性を持つ最悪実行時間解析手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-03-16"},"_buckets":{"deposit":"c05a354d-f3ca-4d43-9c79-d0b78dc42e4d"},"_deposit":{"id":"68430","pid":{"type":"depid","value":"68430","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"高い移植性を持つ最悪実行時間解析手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"高い移植性を持つ最悪実行時間解析手法"},{"subitem_title":"Portable Worst-Case Execution Time Analysis Method","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"実時間処理","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2010-03-16","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"産業技術総合研究所"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Advanced Industrial Science and Technology (AIST)","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/68430/files/IPSJ-TACS0301009.pdf"},"date":[{"dateType":"Available","dateValue":"2012-03-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0301009.pdf","filesize":[{"value":"249.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"25e7a622-2afa-415c-b79c-449b133c79fb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山本, 啓二"},{"creatorName":"石川, 裕"},{"creatorName":"松井, 俊浩"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keiji, Yamamoto","creatorNameLang":"en"},{"creatorName":"Yutaka, Ishikawa","creatorNameLang":"en"},{"creatorName":"Toshihiro, Matsui","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"信頼性の高い実時間システムを構築するためには，実時間システム上で動く実時間タスクの最悪実行時間を見積もり，それがデッドラインを満たすことを保証することが重要である．本論文では，様々なアーキテクチャへの移植に優れた最悪実行時間予測手法を提案し，それを実行時間予測ツール RETAS として実装する．RETAS は，タスクの実行時間をメモリアクセス時間とメモリアクセスを除いた命令実行時間に分けて計算する．メモリアクセス時間はコンパイラの中間表現を解釈し実行するシミュレータを使って求める．メモリアクセスを除いた命令実行時間は，実機上でコードを部分的に実行し，その時間を計測して求める．提案手法の移植性を評価するため，Pentium-M，XScale，SH アーキテクチャに提案手法を実装する．移植に要したコード量はそれぞれ 200～300 行である．また，ベンチマークプログラムの実測値と RETAS の予測値とを比較した結果，+2 から +36% のプラス方向の誤差であることを示し，どのアーキテクチャでも安全に最悪実行時間を予測できることを示す．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"To design a reliable real-time system, it is important to know the worst-case execution time of a real-time task, and to confirm whether it satisfies deadline. In this paper, we propose a new portable worst-case execution time analysis method. Based on this approach, an execution time analysis tool named RETAS is implemented. Execution time is predicted by combining the partial execution of the code and memory access time calculated using a simulator. We demonstrate that RETAS predicts the execution time safely in different environments, Pentium-M, XScale and SH. Porting RETAS to those architectures requires about 100 to 200 code lines to describe architecture dependent features. Comparing with actual and predicted execution times in benchmark programs, the predicted execution times are from +2% to +36% errors against the actual execution times. The results show that RETAS safely predicts the worst case execution times in those CPU architectures.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"87","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"77","bibliographicIssueDates":{"bibliographicIssueDate":"2010-03-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"3"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:28:28.668290+00:00","id":68430,"links":{}}