DREAM: Distributed Reinforcement Learning Enabled Adaptive Mixed-Critical NoC

Nidhi Anantharajaiah, Yunhe Xu, Fabian Lesniak, T. Harbaum, Jürgen Becker
{"title":"DREAM: Distributed Reinforcement Learning Enabled Adaptive Mixed-Critical NoC","authors":"Nidhi Anantharajaiah, Yunhe Xu, Fabian Lesniak, T. Harbaum, Jürgen Becker","doi":"10.1109/ISVLSI59464.2023.10238569","DOIUrl":null,"url":null,"abstract":"Applications of different criticality sharing the same System-on-Chip (SoC) platform are increasing in popularity to reduce overall cost. Spatial and temporal isolation techniques are utilized to reduce inter application influence and to ensure real-time requirements are met. Spatial isolation involves partitioning communication resources and such partitions can result in irregular topologies. It is desirable that the on-chip interconnect on such systems support communication within all possible partition shapes using efficient routing techniques. To improve flexibility, adaptivity and reliability in such systems, it is desirable to incorporate topology agnostic routing algorithms which can compute optimal routes at runtime. For this purpose, we present a Distributed Reinforcement learning Enabled Adaptive Mixed-Critical Network-on-Chip (DREAM NoC) and supporting framework. DREAM is a distributed NoC which uses a topology agnostic reinforcement learning enabled routing algorithm based on the Ant Colony optimization (ACO) metaheuristic. We propose the DREAM framework which comprises of runtime discovery of paths and selection of optimal routes over time based on traffic fluctuations. We compare the performance against other topology agnostic algorithms under uniform random traffic and application traffic of a MPEG4 video decoder. The results show that the presented technique has upto 63% decrease in latency and 25% increase in throughput for certain irregular topologies under uniform random traffic scenario.","PeriodicalId":199371,"journal":{"name":"2023 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI59464.2023.10238569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Applications of different criticality sharing the same System-on-Chip (SoC) platform are increasing in popularity to reduce overall cost. Spatial and temporal isolation techniques are utilized to reduce inter application influence and to ensure real-time requirements are met. Spatial isolation involves partitioning communication resources and such partitions can result in irregular topologies. It is desirable that the on-chip interconnect on such systems support communication within all possible partition shapes using efficient routing techniques. To improve flexibility, adaptivity and reliability in such systems, it is desirable to incorporate topology agnostic routing algorithms which can compute optimal routes at runtime. For this purpose, we present a Distributed Reinforcement learning Enabled Adaptive Mixed-Critical Network-on-Chip (DREAM NoC) and supporting framework. DREAM is a distributed NoC which uses a topology agnostic reinforcement learning enabled routing algorithm based on the Ant Colony optimization (ACO) metaheuristic. We propose the DREAM framework which comprises of runtime discovery of paths and selection of optimal routes over time based on traffic fluctuations. We compare the performance against other topology agnostic algorithms under uniform random traffic and application traffic of a MPEG4 video decoder. The results show that the presented technique has upto 63% decrease in latency and 25% increase in throughput for certain irregular topologies under uniform random traffic scenario.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
梦想:分布式强化学习实现自适应混合临界NoC
为了降低整体成本,不同关键度的应用共享同一个片上系统(SoC)平台越来越受欢迎。利用空间和时间隔离技术来减少应用程序之间的影响,并确保满足实时需求。空间隔离涉及对通信资源进行分区,这种分区可能导致不规则的拓扑结构。这类系统上的片上互连使用有效的路由技术支持所有可能分区形状内的通信是可取的。为了提高系统的灵活性、适应性和可靠性,需要引入拓扑不可知路由算法,以便在运行时计算出最优路由。为此,我们提出了一个分布式强化学习支持的自适应混合关键片上网络(DREAM NoC)和支持框架。DREAM是一个分布式NoC,它使用基于蚁群优化(ACO)元启发式的拓扑不可知强化学习路由算法。我们提出了DREAM框架,该框架包括运行时路径发现和基于流量波动的最佳路径选择。在均匀随机流量和MPEG4视频解码器的应用流量下,将该算法与其他拓扑不可知算法的性能进行了比较。结果表明,在均匀随机流量场景下,对于某些不规则拓扑,该技术的延迟降低了63%,吞吐量提高了25%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Compact Ferroelectric 2T-(n+1)C Cell to Implement AND-OR Logic in Memory 3D-TTP: Efficient Transient Temperature-Aware Power Budgeting for 3D-Stacked Processor-Memory Systems CellFlow: Automated Standard Cell Design Flow Versatile Signal Distribution Networks for Scalable Placement and Routing of Field-coupled Nanocomputing Technologies Revisiting Trojan Insertion Techniques for Post-Silicon Trojan Detection Evaluation
×
引用
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