An adaptive routing helps in evading early network saturation by steering data packets through the less congested area at the oppressive loaded situation. However, performances of adaptive routing are not always promising under all circumstances. Say for, given more freedom in choosing an alternate route on non-minimal paths for a substantially loaded network even may result in worsening network performances due to following longer route under adaptive routing. Here, underlying topology facilitates routing by offering more alternate short-cut routes on minimal or quasi-minimal paths. This work presents a congestion-aware (CA) adaptive routing for one-hop diagonally connected subnet-based mesh (SDmesh) network aiming to facilitate both performances and routing flexibility simultaneously. Our proposed technique on the selected system facilitates packet routing, offering more options in choosing an output link from minimal or quasi-minimal paths and hence helps in lowering packet delay by shortening the length of traversed traffic under the oppressive loaded situation. Furthermore, we have also employed a congestion-aware virtual input crossbar router aiming to split the entire network into two distinct logically separated sub-networks. It facilitates preserving important routing properties like deadlock, live-lock fairness, and other essential routing constraints. Experiments, conducted over two 8×8- and 12×12-sized networks, show an average improvement of 25--87.5% saturated latency and 60--83% throughput improvement under uniform traffic patterns for the proposed CA routing compared to centralized adaptive XY routing. Experimental results on application-specific PARSEC and SPLASH2 benchmark suites show an average of 22--50% latency and 23--30% throughput improvements by the proposed technique compared to centralized XY routing on the baseline mesh network. Moreover, experiments were also carried out to check the performance of the proposed routing method with different newly proposed deadlock-free adaptive routing approaches over the same subnet-based diagonal mesh (SDmesh) network and reported.

中文翻译：

---

逻辑子网在拥塞感知无死锁SDmesh路由中的应用

自适应路由通过在压力负载情况下引导数据包通过不太拥挤的区域来帮助避免早期的网络饱和。然而，自适应路由的性能并不总是在所有情况下都有希望。比如说，考虑到在为大量负载的网络选择非最小路径上的替代路由时有更大的自由度，甚至可能由于在自适应路由下遵循更长的路由而导致网络性能恶化。在这里，底层拓扑通过在最小或准最小路径上提供更多替代的捷径来促进路由。这项工作为单跳对角连接的基于子网的网格 (SDmesh) 网络提出了一种拥塞感知 (CA) 自适应路由，旨在同时促进性能和路由灵活性。我们在所选系统上提出的技术促进了数据包路由，在从最小或准最小路径中选择输出链路时提供了更多选项，因此通过缩短在压迫性负载情况下遍历流量的长度来帮助降低数据包延迟。此外，我们还采用了拥塞感知虚拟输入交​​叉路由器，旨在将整个网络分成两个不同的逻辑分离的子网络。它有助于保留重要的路由属性，如死锁、活锁公平和其他基本路由约束。在两个 8×8 和 12×12 大小的网络上进行的实验表明，与集中式自适应路由相比，在统一流量模式下，所提出的 CA 路由的饱和延迟平均提高了 25--87.5%，吞吐量提高了 60--83% XY 路由。与基准网状网络上的集中式 XY 路由相比，针对特定应用的 PARSEC 和 SPLASH2 基准套件的实验结果显示，所提出的技术平均延迟 22--50% 和 23--30% 吞吐量提高。此外，还进行了实验以检查所提出的路由方法在相同的基于子网的对角网格 (SDmesh) 网络上使用不同的新提出的无死锁自适应路由方法的性能并进行了报告。