{"id":99296,"created":"2025-01-18T23:45:20.915396+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00099296","sets":["1164:2036:7423:7503"]},"path":["7503"],"owner":"11","recid":"99296","title":["重要タスクの応答時間を短縮するリアルタイムスケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-03-08"},"_buckets":{"deposit":"89f73195-0fd5-4fd8-a578-656ade22905b"},"_deposit":{"id":"99296","pid":{"type":"depid","value":"99296","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":"Real-Time Scheduling for Shortening Response Times of Important Tasks","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"スケジューリング・アルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2014-03-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"JAIST","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/99296/files/IPSJ-SLDM14165002.pdf"},"date":[{"dateType":"Available","dateValue":"2016-03-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM14165002.pdf","filesize":[{"value":"531.8 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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c3e4d797-be26-4dc6-ae40-d7fdc862bad8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田中, 清史"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kiyofumi, Tanaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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":"周期タスクに対する代表的なリアルタイムスケジューリング法として，Rate Monotonic（RM） と Early Deadline First（EDF） がある．RM はタスクの重要度を周期として反映させることにより重要タスクのジッタや応答時間を短く保つことが可能であるが，重要度とは無関係に周期を設定することは困難であり，さらにプロセッサを 100%まで使用することが不可能である．EDF は 100%のプロセッサ使用率を可能とするが，タスクの重要度を反映することが不可能であり，特定の重要なタスクのジッタや応答時間を短く保つことができない．本稿では，各タスクが周期と独立した重要度を持つ場合に，重要タスクの応答時間を短縮するスケジューリング方法である適応型 EDF に対し，2 つの改良方法を提案する．シミュレーションによる評価では，2 つの提案改良方法を組み合わせることにより，従来の適応型 EDF に対して平均応答時間が最大で 29.2%短縮した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Rate monotonic (RM) and earliest deadline first (EDF) are representative scheduling algorithms for real-time periodic tasks. RM has a merit that tasks with high-priority (short-period) have small jitters and short response times. However, it is impossible for processor utilization to reach 100% or that tasks are given importance independent of their periods. On the other hand, EDF can utilize processors by 100% with schedulability, while it cannot give tasks fixed priorities or importance, therefore, it is difficult to keep jitters or response times of particular tasks short. This paper proposes two improvement techniques for the adaptive EDF which is a scheduling method that shortens response times of tasks with importance independent of their periods. In the evaluation with simulation, by combining the two improvement techniques, the average response times were reduced by 29.2%, at maximum, compared to the adaptive EDF.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-03-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2014-SLDM-165"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-21T12:06:00.356251+00:00","links":{}}