@article{oai:ipsj.ixsq.nii.ac.jp:00190820,
 author = {Zhongqi, Ma and Ryo, Kurachi and Gang, Zeng and Hiroaki, Takada and Zhongqi, Ma and Ryo, Kurachi and Gang, Zeng and Hiroaki, Takada},
 issue = {8},
 journal = {情報処理学会論文誌},
 month = {Aug},
 note = {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
------------------------------, 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
------------------------------},
 title = {Further Analysis with Linear Programming on Blocking Time Bounds for Partitioned Fixed Priority Multiprocessor Scheduling},
 volume = {59},
 year = {2018}
}