Multi-rate DAG Scheduling Considering Communication Contention for NoC-based Embedded Many-core Processor

Shingo Igarashi, Yuto Kitagawa, Tasuku Ishigooka, Tatsuya Horiguchi, Takuya Azumi
{"title":"Multi-rate DAG Scheduling Considering Communication Contention for NoC-based Embedded Many-core Processor","authors":"Shingo Igarashi, Yuto Kitagawa, Tasuku Ishigooka, Tatsuya Horiguchi, Takuya Azumi","doi":"10.1109/DS-RT47707.2019.8958696","DOIUrl":null,"url":null,"abstract":"Computing platforms for embedded systems are increasingly being transformed into multi/many-core platforms because embedded systems have become extensive, complex, and automated. In the case of an autonomous driving system, various applications are simultaneously running, and low power consumption and large-scale calculation are required. Many-core processors with a multiple instruction, multiple data (MIMD) architecture can meet these requirements. This paper proposes a scheduling algorithm for an automotive driving system expressed in a directed acyclic graph (DAG) and we use Kalray MPPA-256 as the target many-core processor. On the basis of the architecture of Kalray MPPA-256, task processing that requires large-scale calculation and intercore communication is performed while avoiding communication contention by using a proposed grouping computational resource. In addition, we propose a scheduling method for a multi-rate DAG which is a DAG with multiple periods. This method generates a DAG task in a hyperperiod and schedules the DAG with dependency on tasks that have been released closely. The formulas for prioritization and processor selection are proposed for various generated tasks in a hyperperiod. Evaluation results show that the proposed algorithm is superior to existing DAG scheduling algorithms with regard to schedulability and deadline miss ratio.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DS-RT47707.2019.8958696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Computing platforms for embedded systems are increasingly being transformed into multi/many-core platforms because embedded systems have become extensive, complex, and automated. In the case of an autonomous driving system, various applications are simultaneously running, and low power consumption and large-scale calculation are required. Many-core processors with a multiple instruction, multiple data (MIMD) architecture can meet these requirements. This paper proposes a scheduling algorithm for an automotive driving system expressed in a directed acyclic graph (DAG) and we use Kalray MPPA-256 as the target many-core processor. On the basis of the architecture of Kalray MPPA-256, task processing that requires large-scale calculation and intercore communication is performed while avoiding communication contention by using a proposed grouping computational resource. In addition, we propose a scheduling method for a multi-rate DAG which is a DAG with multiple periods. This method generates a DAG task in a hyperperiod and schedules the DAG with dependency on tasks that have been released closely. The formulas for prioritization and processor selection are proposed for various generated tasks in a hyperperiod. Evaluation results show that the proposed algorithm is superior to existing DAG scheduling algorithms with regard to schedulability and deadline miss ratio.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑通信竞争的嵌入式多核处理器多速率DAG调度
由于嵌入式系统已变得广泛、复杂和自动化,嵌入式系统的计算平台正日益向多核/多核平台转变。在自动驾驶系统中,各种应用程序同时运行,需要低功耗和大规模计算。采用多指令多数据(MIMD)架构的多核处理器可以满足这些要求。本文提出了一种用有向无环图(DAG)表示的汽车驾驶系统调度算法,并以Kalray MPPA-256为目标多核处理器。在Kalray MPPA-256架构的基础上,利用分组计算资源避免了通信争用,完成了需要大规模计算和核间通信的任务处理。此外,我们还提出了一种多速率DAG的调度方法,即具有多个周期的DAG。此方法在超周期中生成DAG任务,并将DAG与已紧密释放的任务的依赖关系进行调度。提出了超周期内各种生成任务的优先级和处理器选择公式。评价结果表明,该算法在可调度性和最后期限缺失率方面优于现有的DAG调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
How can Machine Learning Support the Practice of Modeling and Simulation? —A Review and Directions for Future Research Performance Gains in V2X Experiments Using Distributed Simulation in the Veins Framework Formal Modelling and Verification of Real-Time Self-Adaptive Systems [DS-RT 2019 Title Page] Modelling and Simulation of ElasticSearch using CloudSim
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1