基于图的异构虫洞NoCs缓冲区感知时序分析
Graph-based Approach for Buffer-aware Timing Analysis of Heterogeneous Wormhole NoCs under Bursty Traffic
摘要：
本文研究了异构虫孔片上网络的最坏情况时序分析问题，当发生连续分组排队（CPQ）时，具有不同缓冲区大小和传输速度的路由器。后者意味着在网络中存在一个流的多个连续分组排队。这种情况发生在突发流量的情况下，但也适用于不可中断的流量。已知进行这样的分析是一个具有挑战性的问题，这是由于在启用背压机制时复杂的拥塞模式。我们解决这个问题，通过扩展我们以前的工作，计算最大延迟范围使用网络微积分，称为缓冲区感知最坏情况下的时序分析（BATA）的适用性域。我们提出了一种新的基于图的方法，以改善由于背压的间接阻塞的分析，同时捕捉CPQ效应，并保持流之间的依赖关系的信息。此外，所介绍的方法提高了计算的间接阻塞延迟界限的复杂性，并确保这些界限的安全性，即使是不可压缩的流量。我们提供了进一步的见解，最坏情况下的延迟界限所产生的扩展BATA与基于图形的方法，表示G-BATA的紧密性和复杂性问题。我们的评估表明，与基本BATA相比，复杂性降低了100倍，同时提供了71%的平均紧密度。最后，我们评估了G-BATA对一个现实用例的改进，以对抗最近最先进的方法。该评估显示了G-BATA在更一般的假设下的适用性以及这种功能对紧密性和计算时间的影响。
英文摘要：
This paper addresses the problem of worst-case timing analysis of heterogeneous wormhole NoCs, i.e., routers with different buffer sizes and transmission speeds, when consecutive packet queuing (CPQ) occurs. The latter means that there are several consecutive packets of one flow queuing in the network. This scenario happens in the case of bursty traffic but also for non-schedulable traffic. Conducting such an analysis is known to be a challenging issue due to the sophisticated congestion patterns when enabling backpressure mechanisms. We tackle this problem through extending the applicability domain of our previous work for computing maximum delay bounds using Network Calculus, called Buffer-aware worst-case Timing Analysis (BATA). We propose a new Graph-based approach to improve the analysis of indirect blocking due to backpressure, while capturing the CPQ effect and keeping the information about dependencies between flows. Furthermore, the introduced approach improves the computation of indirect-blocking delay bounds in terms of complexity and ensures the safety of these bounds even for non-schedulable traffic. We provide further insights into the tightness and complexity issues of worst-case delay bounds yielded by the extended BATA with the Graph-based approach, denoted G-BATA. Our assessments show that the complexity has decreased by up to 100 times while offering an average tightness ratio of 71%, with reference to the basic BATA. Finally, we evaluate the yielded improvements with G-BATA for a realistic use case against a recent state-of-the-art approach. This evaluation shows the applicability of G-BATA under more general assumptions and the impact of such a feature on the tightness and computation time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
