WEKO3
-
RootNode
アイテム
Multiprocessor Semi-fixed-priority Scheduling
https://ipsj.ixsq.nii.ac.jp/records/185887
https://ipsj.ixsq.nii.ac.jp/records/185887e8f0ad9a-a04e-46bd-88f5-5ab296b93349
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2018 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2018-02-15 | |||||||
タイトル | ||||||||
タイトル | Multiprocessor Semi-fixed-priority Scheduling | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Multiprocessor Semi-fixed-priority Scheduling | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | [特集:組込みシステム工学] optimal multiprocessor real-time scheduling, semi-fixed-priority scheduling, schedulability analysis | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
著者所属 | ||||||||
Graduate School of Industrial Technology, Advanced Institute of Industrial Technology/Presently with Graduate School of Information Science and Technology, The University of Tokyo | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Graduate School of Industrial Technology, Advanced Institute of Industrial Technology / Presently with Graduate School of Information Science and Technology, The University of Tokyo | ||||||||
著者名 |
Hiroyuki, Chishiro
× Hiroyuki, Chishiro
|
|||||||
著者名(英) |
Hiroyuki, Chishiro
× Hiroyuki, Chishiro
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Optimal multiprocessor real-time scheduling can achieve full system utilization with implicit-deadline periodic task sets. However, worst case execution time (WCET) analysis is difficult on state-of-the-art hardware/software platforms due to the complex hierarchy of shared caches and multiprogramming. The actual case execution time of each task is usually shorter than its WCET and imprecise computation is an effective method to make better use of the remaining processor time. Semi-fixed-priority scheduling is real-time scheduling that supports imprecise computation and multiprocessors but conventional semi-fixed-priority scheduling algorithms are not optimal. This paper proposes an optimal multiprocessor semi-fixed-priority scheduling algorithm that supports imprecise computation. The proposed algorithm, which integrates Reduction to Uniprocessor (RUN) for Rate Monotonic with Wind-up Part (RMWP), called RUN-RMWP, is superior to Partitioned RMWP algorithm in terms of schedulability analysis. Simulation studies show that RUN-RMWP has a few more preemptions/migrations compared to RUN but confirms its optimality even though conventional semi-fixed priority scheduling algorithms are not optimal. ------------------------------ 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.202 ------------------------------ |
|||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Optimal multiprocessor real-time scheduling can achieve full system utilization with implicit-deadline periodic task sets. However, worst case execution time (WCET) analysis is difficult on state-of-the-art hardware/software platforms due to the complex hierarchy of shared caches and multiprogramming. The actual case execution time of each task is usually shorter than its WCET and imprecise computation is an effective method to make better use of the remaining processor time. Semi-fixed-priority scheduling is real-time scheduling that supports imprecise computation and multiprocessors but conventional semi-fixed-priority scheduling algorithms are not optimal. This paper proposes an optimal multiprocessor semi-fixed-priority scheduling algorithm that supports imprecise computation. The proposed algorithm, which integrates Reduction to Uniprocessor (RUN) for Rate Monotonic with Wind-up Part (RMWP), called RUN-RMWP, is superior to Partitioned RMWP algorithm in terms of schedulability analysis. Simulation studies show that RUN-RMWP has a few more preemptions/migrations compared to RUN but confirms its optimality even though conventional semi-fixed priority scheduling algorithms are not optimal. ------------------------------ 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.202 ------------------------------ |
|||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN00116647 | |||||||
書誌情報 |
情報処理学会論文誌 巻 59, 号 2, 発行日 2018-02-15 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-7764 |