Fast and accurate performance analysis techniques are essential in early design space exploration and pre-silicon evaluations, including software eco-system development. In particular, on-chip communication continues to play an increasingly important role as the many-core processors scale up. This paper presents the first performance analysis technique that targets networks-on-chip (NoCs) that employ weighted round-robin (WRR) arbitration. Besides fairness, WRR arbitration provides flexibility in allocating bandwidth proportionally to the importance of the traffic classes, unlike basic round-robin and priority-based arbitration. The proposed approach first estimates the effective service time of the packets in the queue due to WRR arbitration. Then, it uses the effective service time to compute the average waiting time of the packets. Next, we incorporate a decomposition technique to extend the analytical model to handle NoC of any size. The proposed approach achieves less than 5% error while executing real applications and 10% error under challenging synthetic traffic with different burstiness levels.

中文翻译：

---

加权循环仲裁对NoCs的理论分析与评估

快速准确的性能分析技术对于早期设计空间探索和硅前评估（包括软件生态系统开发）至关重要。特别是，随着众核处理器规模的扩大，片上通信继续发挥着越来越重要的作用。本文介绍了第一种针对采用加权循环 (WRR) 仲裁的片上网络 (NoC) 的性能分析技术。除了公平之外，与基本的循环和基于优先级的仲裁不同，WRR 仲裁还提供了根据流量类别的重要性按比例分配带宽的灵活性。由于WRR仲裁，所提出的方法首先估计队列中数据包的有效服务时间。然后，它使用有效服务时间来计算数据包的平均等待时间。接下来，我们采用分解技术来扩展分析模型以处理任何规模的 NoC。所提出的方法在执行实际应用程序时实现了小于 5% 的错误率，在具有不同突发级别的具有挑战性的合成流量下实现了 10% 的错误率。