LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor

• Item type: Journal(1)
• 公開日: 2022-09-15
• タイトル: LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor
• タイトル / 言語: en
• タイトル: LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [特集:組込みシステム工学] multi-period DAG, multi/many-core, contention-free, parallel processing, logical execution time
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Graduate School of Science and Engineering, Saitama University
• 著者所属: Graduate School of Science and Engineering, Saitama University
• 著者所属: Graduate School of Science and Engineering, Saitama University
• 著者所属(英): en
• 著者所属(英): Graduate School of Science and Engineering, Saitama University
• 著者所属(英): en
• 著者所属(英): Graduate School of Science and Engineering, Saitama University
• 著者所属(英): en
• 著者所属(英): Graduate School of Science and Engineering, Saitama University
• 著者名: Atsushi, Yano; Shingo, Igarashi; Takuya, Azumi
• 著者名(英): Atsushi, Yano; Shingo, Igarashi; Takuya, Azumi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Embedded systems such as self-driving systems require computing platforms with high computing power and low power consumption. Multi/many-core platforms meet these requirements effectively. However, for hard real-time applications, multiple demands on shared resources can impede real-time performance, and in particular, memory is a resource that can restrict the desired performance significantly. Therefore, the logical execution time (LET) paradigm has gained attention to make the timing of memory access deterministic. This paper proposes a theoretical scheduling method for a model applying the LET paradigm to the directed acyclic graph (DAG) nodes for a multi/many-core platform. However, the LET paradigm lacks scalability owing to the overhead caused because the LET paradigm is set longer than the actual execution time of the task. The proposed method performs a parallel calculation of tasks utilizing many cores to deal with the overhead caused by adopting the LET paradigm. The evaluation shows that the proposed method benefits from the adoption of the LET paradigm and that the end-to-end latency variation is smaller than in the existing scheduling methods. Furthermore, the evaluation shows that the proposed method can maintain the task deadline miss low, despite the overhead of the LET paradigm.; ------------------------------; 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.30(2022) (online); DOI http://dx.doi.org/10.2197/ipsjjip.30.646; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Embedded systems such as self-driving systems require computing platforms with high computing power and low power consumption. Multi/many-core platforms meet these requirements effectively. However, for hard real-time applications, multiple demands on shared resources can impede real-time performance, and in particular, memory is a resource that can restrict the desired performance significantly. Therefore, the logical execution time (LET) paradigm has gained attention to make the timing of memory access deterministic. This paper proposes a theoretical scheduling method for a model applying the LET paradigm to the directed acyclic graph (DAG) nodes for a multi/many-core platform. However, the LET paradigm lacks scalability owing to the overhead caused because the LET paradigm is set longer than the actual execution time of the task. The proposed method performs a parallel calculation of tasks utilizing many cores to deal with the overhead caused by adopting the LET paradigm. The evaluation shows that the proposed method benefits from the adoption of the LET paradigm and that the end-to-end latency variation is smaller than in the existing scheduling methods. Furthermore, the evaluation shows that the proposed method can maintain the task deadline miss low, despite the overhead of the LET paradigm.; ------------------------------; 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.30(2022) (online); DOI http://dx.doi.org/10.2197/ipsjjip.30.646; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 63, 号 9, 発行日 2022-09-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764
• 公開者 / 言語: ja
• 公開者 / 出版者: 情報処理学会