{"updated":"2025-01-22T22:48:49.030850+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018359","sets":["934:1119:1136:1137"]},"path":["1137"],"owner":"1","recid":"18359","title":["動的計画法を用いたキャッシュフラッシュの最悪タイミングの探索手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-12-15"},"_buckets":{"deposit":"93b53175-7265-482b-9c3d-5d3166f31883"},"_deposit":{"id":"18359","pid":{"type":"depid","value":"18359","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"動的計画法を用いたキャッシュフラッシュの最悪タイミングの探索手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"動的計画法を用いたキャッシュフラッシュの最悪タイミングの探索手法"},{"subitem_title":"A Search Algorithm of Worst-Case Cache Flush Timings Using Dynamic Programming","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"実時間処理","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2005-12-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報科学研究科情報システム学専攻"},{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"名古屋大学大学院情報科学研究科情報システム学専攻"},{"subitem_text_value":"名古屋大学大学院情報科学研究科情報システム学専攻"},{"subitem_text_value":"豊橋技術科学大学情報工学系"}]},"item_3_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":"Department of Information and Computer Sciences Toyohashi University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering Graduate School of Information Science Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering Graduate School of Information Science Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Sciences Toyohashi University of Technology","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/18359/files/IPSJ-TACS4616008.pdf"},"date":[{"dateType":"Available","dateValue":"2007-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS4616008.pdf","filesize":[{"value":"427.5 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":"2229d266-56a2-4f11-82b4-3ade97a63b9b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"宮本, 寛史"},{"creatorName":"飯山, 真一"},{"creatorName":"冨山, 宏之"},{"creatorName":"高田, 広章"},{"creatorName":"中島, 浩"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroshi, Miyamoto","creatorNameLang":"en"},{"creatorName":"Shinichi, Iiyama","creatorNameLang":"en"},{"creatorName":"Hiroyuki, Tomiyama","creatorNameLang":"en"},{"creatorName":"Hiroaki, Takada","creatorNameLang":"en"},{"creatorName":"Hiroshi, Nakashima","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":"近年，ハードリアルタイムシステムにおいてもキャッシュメモリ（以下，キャッシュ）の利用が望まれており，キャッシュを考慮した最悪実行時間解析が必要になっている．マルチタスキング環境では，タスク切替えによってフラッシュされるキャッシュライン数はそのタイミングに依存し，それによって実行時間が変化する．そのため，キャッシュを考慮した最悪実行時間解析を行うには，最も実行時間が長くなるタスク切替えタイミング（以下，最悪フラッシュタイミング）を求めることが必要である．本論文では，最悪フラッシュタイミングの探索手法を提案し，その有効性を示す．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In recent years, the use of cache memory has been desired in hard real-time systems in order to reduce the memory access time. To enable it, accurate analysis of the worst-case execution time considering cache flushes is necessary since the cache may be flushed by preempting tasks in a multitask environment. This paper proposes a method to find the worst-case timing of cache flushes and demonstrates its effectiveness.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"94","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"85","bibliographicIssueDates":{"bibliographicIssueDate":"2005-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG16(ACS12)","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:51:06.913672+00:00","id":18359,"links":{}}