Towards an Analytical Model of Latency in Deflection Routing: A Stochastic Process Approach for Bufferless NoCs

K. Tatas
{"title":"Towards an Analytical Model of Latency in Deflection Routing: A Stochastic Process Approach for Bufferless NoCs","authors":"K. Tatas","doi":"10.1109/MOCAST52088.2021.9493370","DOIUrl":null,"url":null,"abstract":"Performance analysis and design space exploration of bufferless Networks-on-Chip is done mainly through cycle accurate simulation which is time-consuming, while an analytical model seems out of reach for now. In order to raise the level of abstraction as well as capture the inherently probabilistic behavior of deflection routing, this paper presents a methodology for employing Markov chain models in the analysis of the behavior of bufferless Networks-on-Chip. A formal way of describing a bufferless NoC topology as a set of discrete-time Markov chains is presented. It is demonstrated that by combining this description with the network average distance, it is possible to obtain the expectation of the number of hops between any pair of nodes in the network as a function of the flit deflection probability. Comparisons between the proposed model and cycle-accurate simulation show that the proposed methodology achieves good accuracy at the useful injection rate range, with negligible computational cost.","PeriodicalId":146990,"journal":{"name":"2021 10th International Conference on Modern Circuits and Systems Technologies (MOCAST)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th International Conference on Modern Circuits and Systems Technologies (MOCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOCAST52088.2021.9493370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Performance analysis and design space exploration of bufferless Networks-on-Chip is done mainly through cycle accurate simulation which is time-consuming, while an analytical model seems out of reach for now. In order to raise the level of abstraction as well as capture the inherently probabilistic behavior of deflection routing, this paper presents a methodology for employing Markov chain models in the analysis of the behavior of bufferless Networks-on-Chip. A formal way of describing a bufferless NoC topology as a set of discrete-time Markov chains is presented. It is demonstrated that by combining this description with the network average distance, it is possible to obtain the expectation of the number of hops between any pair of nodes in the network as a function of the flit deflection probability. Comparisons between the proposed model and cycle-accurate simulation show that the proposed methodology achieves good accuracy at the useful injection rate range, with negligible computational cost.
偏转路由延迟的解析模型:无缓冲noc的随机过程方法
无缓冲片上网络的性能分析和设计空间探索主要通过周期精确仿真来完成,耗时长,而分析模型目前似乎遥不可及。为了提高抽象水平并捕捉偏转路由固有的概率行为,本文提出了一种利用马尔可夫链模型分析无缓冲片上网络行为的方法。提出了一种将无缓冲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学术官方微信