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.