{"updated":"2025-01-21T21:03:57.591148+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00075765","sets":["581:6276:6501"]},"path":["6501"],"owner":"11","recid":"75765","title":["時間保護のためのタスク起動遅延付き階層型スケジューリングアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-08-15"},"_buckets":{"deposit":"d4ce2b6f-ee62-4880-a0d3-1d3c42363eba"},"_deposit":{"id":"75765","pid":{"type":"depid","value":"75765","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"時間保護のためのタスク起動遅延付き階層型スケジューリングアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"時間保護のためのタスク起動遅延付き階層型スケジューリングアルゴリズム"},{"subitem_title":"Hierarchical Scheduling with Delayed Activation of Tasks for Temporal Protection","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2011-08-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報科学研究科附属組込みシステム研究センター"},{"subitem_text_value":"名古屋大学大学院情報科学研究科附属組込みシステム研究センター"},{"subitem_text_value":"名古屋大学大学院情報科学研究科附属組込みシステム研究センター／名古屋大学大学院情報科学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Embedded Computing Systems, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Center for Embedded Computing Systems, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Center for Embedded Computing Systems, Nagoya University / Graduate School of Information Science, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/75765/files/IPSJ-JNL5208006.pdf"},"date":[{"dateType":"Available","dateValue":"2013-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5208006.pdf","filesize":[{"value":"815.7 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b3f94e87-f71e-4d9e-97ce-980c2d7cc8b4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松原, 豊"},{"creatorName":"本田, 晋也"},{"creatorName":"高田, 広章"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yutaka, Matsubara","creatorNameLang":"en"},{"creatorName":"Shinya, Honda","creatorNameLang":"en"},{"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":"分散リアルタイムシステムにおいて，個別に開発・検証されたリアルタイムアプリケーションを，単一のプロセッサに統合して動作させるための階層型スケジューリングアルゴリズムが数多く提案されている．本論文では，統合前に，プリエンプティブな固定優先度ベーススケジューリングによりスケジュール可能なリアルタイムアプリケーションを対象に，優先度設計を変更することなく統合後もスケジュール可能であることを保証する階層型スケジューリングアルゴリズムを提案する．提案アルゴリズムの正当性を理論的に証明し，さらに，スケジューリングシミュレータを用いて，同一のアプリケーションに対するスケジュール可能性を従来アルゴリズムと比較した．その結果，従来アルゴリズムでは統合後にデッドラインをミスしてしまうアプリケーションが，提案アルゴリズムによりスケジュール可能であることを確認した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Many hierarchical scheduling algorithms have been proposed for integrating independently developed real-time applications into one processor. This paper presents a new hierarchical scheduling based on the Bandwidth Sharing Server (BSS). The presented algorithm supports fixed-priority local scheduler with delayed activation of tasks. Simulation results indicate that if an application is schedulable with fixed-priorities, then the application is in isolation also schedulable without modification of priority of each tasks when it is integrated with other applications into the same processor by using the proposed scheduling algorithm.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2401","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2387","bibliographicIssueDates":{"bibliographicIssueDate":"2011-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"52"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:32:47.383311+00:00","id":75765,"links":{}}