{"created":"2025-01-19T00:56:45.966676+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00190820","sets":["581:9322:9330"]},"path":["9330"],"owner":"11","recid":"190820","title":["Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-08-15"},"_buckets":{"deposit":"341ad121-914b-4ffb-a189-d20c75994e2a"},"_deposit":{"id":"190820","pid":{"type":"depid","value":"190820","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling","author_link":["437738","437734","437737","437736","437733","437732","437731","437735"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling"},{"subitem_title":"Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[組込みシステム工学] partitioned fixed priority, multiprocessor scheduling, FMLP+, blocking time bound, linear programming","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2018-08-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"The Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"The Graduate School of Information Science, Nagoya University"},{"subitem_text_value":"The Graduate School of Engineering, Nagoya University"},{"subitem_text_value":"The Graduate School of Information Science, Nagoya University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"The Graduate School of Information Science, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"The Graduate School of Engineering, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"The Graduate School of Information Science, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/190820/files/IPSJ-JNL5908003.pdf","label":"IPSJ-JNL5908003.pdf"},"date":[{"dateType":"Available","dateValue":"2020-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5908003.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"909fe580-b8c9-426d-b9b3-362feb16cb41","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Zhongqi, Ma"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Kurachi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gang, Zeng"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroaki, Takada"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Zhongqi, Ma","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Kurachi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gang, Zeng","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"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":"The recently developed FMLP+ provides significant advantages for partitioned fixed priority scheduling, since it ensures asymptotically optimal O(n) maximum priority-inversion blocking. The constraints under the FMLP+ can be exploited to determine bounds on the blocking time. However, these bounds may be pessimistic since shared resources local to a processor do not incur priority-inversion blocking in some cases. Consequently, a schedulable task set may be erroneously judged as unschedulable because of these pessimistic values. Based on our analysis, additional constraints were added to compute the maximum blocking time bound of each task with linear programming and the corresponding worst-case response time. The results of experiments show our proposed strategy is less pessimistic than existing strategies. Meanwhile, we also demonstrate that local resource sharing should be used instead of global resource sharing where possible.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.26(2018) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.26.540\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The recently developed FMLP+ provides significant advantages for partitioned fixed priority scheduling, since it ensures asymptotically optimal O(n) maximum priority-inversion blocking. The constraints under the FMLP+ can be exploited to determine bounds on the blocking time. However, these bounds may be pessimistic since shared resources local to a processor do not incur priority-inversion blocking in some cases. Consequently, a schedulable task set may be erroneously judged as unschedulable because of these pessimistic values. Based on our analysis, additional constraints were added to compute the maximum blocking time bound of each task with linear programming and the corresponding worst-case response time. The results of experiments show our proposed strategy is less pessimistic than existing strategies. Meanwhile, we also demonstrate that local resource sharing should be used instead of global resource sharing where possible.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.26(2018) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.26.540\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2018-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"59"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":190820,"updated":"2025-01-20T01:02:24.444721+00:00","links":{}}