WEKO3
アイテム
Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling
https://ipsj.ixsq.nii.ac.jp/records/190820
https://ipsj.ixsq.nii.ac.jp/records/1908205544f92e-7514-423c-9bde-087e551832cc
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5908003.pdf (1.0 MB)
|
Copyright (c) 2018 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2018-08-15 | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling | |||||||||||||
| タイトル | ||||||||||||||
| 言語 | en | |||||||||||||
| タイトル | Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | [組込みシステム工学] partitioned fixed priority, multiprocessor scheduling, FMLP+, blocking time bound, linear programming | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | journal article | |||||||||||||
| 著者所属 | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The Graduate School of Engineering, Nagoya University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The Graduate School of Engineering, Nagoya University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The Graduate School of Information Science, Nagoya University | ||||||||||||||
| 著者名 |
Zhongqi, Ma
× Zhongqi, Ma
× Ryo, Kurachi
× Gang, Zeng
× Hiroaki, Takada
|
|||||||||||||
| 著者名(英) |
Zhongqi, Ma
× Zhongqi, Ma
× Ryo, Kurachi
× Gang, Zeng
× Hiroaki, Takada
|
|||||||||||||
| 論文抄録 | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | 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. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.26(2018) (online) DOI http://dx.doi.org/10.2197/ipsjjip.26.540 ------------------------------ |
|||||||||||||
| 論文抄録(英) | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | 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. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.26(2018) (online) DOI http://dx.doi.org/10.2197/ipsjjip.26.540 ------------------------------ |
|||||||||||||
| 書誌レコードID | ||||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||||
| 収録物識別子 | AN00116647 | |||||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 59, 号 8, 発行日 2018-08-15 |
|||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||||
