A new mechanism to reduce congestion on TDM networks-on-chips

Daniel Vergeylen, A. K. Lusala, J. Legat
{"title":"A new mechanism to reduce congestion on TDM networks-on-chips","authors":"Daniel Vergeylen, A. K. Lusala, J. Legat","doi":"10.1109/ReCoSoC.2011.5981515","DOIUrl":null,"url":null,"abstract":"This paper presents a mechanism to decrease the congestion on TDM networks handling both Best Effort and Guaranteed Throughput traffic. The mechanism consists of an algorithm which gives an optimal Time Slot to begin transactions between source and destination, thus maximising the probability of successfully reserving a path through the network, to guarantee Quality of Service for the streaming traffic. In order to evaluate the improvements given by the algorithm, a 4×4 2D mesh was simulated in the Soclib environment under random traffic and compared to a same mesh not using the algorithm. Simulation results show that the rate of acceptance of connections from a source to a destination through the network is significantly higher when using the algorithm illustrating a decrease in the global congestion.","PeriodicalId":103130,"journal":{"name":"6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReCoSoC.2011.5981515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a mechanism to decrease the congestion on TDM networks handling both Best Effort and Guaranteed Throughput traffic. The mechanism consists of an algorithm which gives an optimal Time Slot to begin transactions between source and destination, thus maximising the probability of successfully reserving a path through the network, to guarantee Quality of Service for the streaming traffic. In order to evaluate the improvements given by the algorithm, a 4×4 2D mesh was simulated in the Soclib environment under random traffic and compared to a same mesh not using the algorithm. Simulation results show that the rate of acceptance of connections from a source to a destination through the network is significantly higher when using the algorithm illustrating a decrease in the global congestion.
一种新的机制来减少片上时分复用网络的拥塞
本文提出了一种同时处理最佳努力和保证吞吐量的TDM网络中减少拥塞的机制。该机制由一种算法组成,该算法给出源和目标之间开始事务的最佳时隙,从而最大化通过网络成功保留路径的概率,以保证流流量的服务质量。为了评价该算法的改进效果,在随机交通的Soclib环境中模拟了一个4×4二维网格,并与未使用该算法的相同网格进行了比较。仿真结果表明,当使用该算法时,从源到目的的连接通过网络的接受率显着提高,表明全局拥塞减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信