An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

IF 0.6 Q3 ENGINEERING, MULTIDISCIPLINARY
Munib Ahmed, M. I. Baig
{"title":"An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network","authors":"Munib Ahmed, M. I. Baig","doi":"10.22581/muet1982.2302.07","DOIUrl":null,"url":null,"abstract":"Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.","PeriodicalId":44836,"journal":{"name":"Mehran University Research Journal of Engineering and Technology","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mehran University Research Journal of Engineering and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22581/muet1982.2302.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.
一种改进的片上二维网格网络非局部拥塞感知和负载均衡算法
由于多核设计技术的进步,IC(集成电路)设计者已经扩展了单芯片多核设计。这些多核之间有效通信的一种特权方式是片上网络(NoC)。通过检索非本地节点的拥塞信息,设计一种能够将数据路由到非拥塞路径的有效路由算法是NoC中最显著的研究挑战。本研究提出了一种改进的拥塞感知负载均衡路由算法。非本地或远程链路拥塞感知是通过数据包传播拥塞信息来实现的。通过计算从源节点到目的节点的跳数,在目的节点的象限中,已经定义了中间节点,并且在计算到中间节点的最小拥塞路由之后,该路由也存储在用于源路由的数据包中。此外,为了实现负载均衡,将网络划分为两个区域,即高拥塞区域(HCA)和低拥塞区域(LCA)。对于负载平衡,从HCA中选择LCA中的一个节点作为数据包的输出。在合成流量模式下,以平均延迟、平均吞吐量、功耗和可扩展性分析的形式对所提出的算法进行了比较。仿真实验表明,该算法的平均时延和吞吐量分别比现有算法提高了31.28%和5.28%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
76
审稿时长
40 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信