{"updated":"2025-01-21T16:01:15.442879+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00090455","sets":["1164:1867:7090:7091"]},"path":["7091"],"owner":"11","recid":"90455","title":["マルチコア向けFIFO式プリエンプティブ同期プロトコルのスケジューラビリティ評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-02-21"},"_buckets":{"deposit":"09feac87-b882-4cb0-a58c-b9c252748ccb"},"_deposit":{"id":"90455","pid":{"type":"depid","value":"90455","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"マルチコア向けFIFO式プリエンプティブ同期プロトコルのスケジューラビリティ評価","author_link":["0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"マルチコア向けFIFO式プリエンプティブ同期プロトコルのスケジューラビリティ評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"マルチコア・メニーコアとスケジューリング","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2013-02-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報科学研究科"},{"subitem_text_value":"名古屋大学大学院情報科学研究科"},{"subitem_text_value":"名古屋大学大学院情報科学研究科"},{"subitem_text_value":"名古屋大学大学院情報科学研究科"}]},"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/90455/files/IPSJ-OS13124003.pdf"},"date":[{"dateType":"Available","dateValue":"2015-02-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-OS13124003.pdf","filesize":[{"value":"717.6 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":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"99cdf757-4571-4d2b-953d-c622d19769ee","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤谷隆宏"},{"creatorName":"松原豊"},{"creatorName":"加藤真平"},{"creatorName":"高田広章"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10444176","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マルチコアリアルタイムシステムでは，システムの時間制約を維持するため，コア間のリソース共有の最大ブロック時間を導出できることが重要となる．これまで様々なマルチコア向け同期プロトコルが提案されてきているが，その多くが高優先度タスクのスケジューラビリティの低い，ノンプリエンプティブ方式を採用したものであり，同時に複数のロックを取得するネストをサポートしていないものであった．本論文では，ネストをサポートし，プリエンプティブなスピンを採用した，高優先度タスクのスケジューラビリティの改善するプロトコルを提案した．さらに，静的優先度パーティショニングスケジューリング方式の際の，タスクの最大ブロック時間計算式を導出し，タスクの最悪応答時間計算式を導出した．評価の結果，従来の方式よりも，高優先度タスクの最悪応答時間が最大で13%，スケジューラビリティが最大6.5%改善されたことを示す．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告システムソフトウェアとオペレーティング・システム（OS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2013-02-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2013-OS-124"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:40:01.958621+00:00","id":90455,"links":{}}