片上网络中的公平速率分组仲裁

F. Guderian, E. Fischer, M. Winter, G. Fettweis
{"title":"片上网络中的公平速率分组仲裁","authors":"F. Guderian, E. Fischer, M. Winter, G. Fettweis","doi":"10.1109/SOCC.2011.6085085","DOIUrl":null,"url":null,"abstract":"This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.","PeriodicalId":365422,"journal":{"name":"2011 IEEE International SOC Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Fair rate packet arbitration in Network-on-Chip\",\"authors\":\"F. Guderian, E. Fischer, M. Winter, G. Fettweis\",\"doi\":\"10.1109/SOCC.2011.6085085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.\",\"PeriodicalId\":365422,\"journal\":{\"name\":\"2011 IEEE International SOC Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International SOC Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCC.2011.6085085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International SOC Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCC.2011.6085085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

本文提出了两种新的仲裁技术来实现公平的链路带宽分配。一种技术是加权轮询方案,其权重基于输入端口上竞争流的数量。第二种技术是基于年龄的方案,具有概率仲裁,其中遍历的数据包距离近似于年龄。与现有的工作相比,这两种方案几乎达到了链路带宽分配的绝对公平,并且简化了仲裁指标的计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fair rate packet arbitration in Network-on-Chip
This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Keynote speaker An analytical model to estimate PCM failure probability due to process variations A high-performance low VMIN 55nm 512Kb disturb-free 8T SRAM with adaptive VVSS control “Manufacturing test of systems-on-a-chip (SoCs)” A silicon core for an acoustic archival tag
×
引用
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