A novel flow control scheme for best effort traffics in Network-on-Chip based on Weighted Max-Min-fairness

Fahimeh Jafari, M. Yaghmaee
{"title":"A novel flow control scheme for best effort traffics in Network-on-Chip based on Weighted Max-Min-fairness","authors":"Fahimeh Jafari, M. Yaghmaee","doi":"10.1109/ISTEL.2008.4651346","DOIUrl":null,"url":null,"abstract":"Network on chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future system-on-chip (SoC) designs. Recently, end to end flow control has gained popularity in the design process of network-on-chip based SoCs. Where flow control is employed, fairness issues need to be considered as well. In fact, one of most difficult aspects of flow control is that of treating all sources fairly when it is necessary to turn traffic away from the network. In this paper, we propose a flow control scheme which admits max-min fairness criterion for all sources. In fact, we formulate weighted max-min fairness criterion for the NoC architecture and present implementation to be used as flow control mechanism.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Network on chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future system-on-chip (SoC) designs. Recently, end to end flow control has gained popularity in the design process of network-on-chip based SoCs. Where flow control is employed, fairness issues need to be considered as well. In fact, one of most difficult aspects of flow control is that of treating all sources fairly when it is necessary to turn traffic away from the network. In this paper, we propose a flow control scheme which admits max-min fairness criterion for all sources. In fact, we formulate weighted max-min fairness criterion for the NoC architecture and present implementation to be used as flow control mechanism.
基于加权最大-最小公平性的片上网络最优流量控制方案
为了在未来的片上系统(SoC)设计中实现模块化和高性能,片上网络(NoC)已被提出作为传统专用总线的一种有吸引力的替代方案。近年来,端到端流量控制在基于片上网络的soc的设计过程中得到了广泛的应用。在使用流量控制时,还需要考虑公平性问题。事实上,流量控制最困难的方面之一是,当有必要将流量从网络中转移出去时,公平地对待所有来源。本文提出了一种对所有信息源都承认最大最小公平性准则的流量控制方案。实际上,我们为NoC架构制定了加权最大最小公平性准则,并给出了实现,作为流量控制机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信