Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of supercomputers. In this article, wepresent dmodc, a fast deterministic routing algorithmfo...
详细信息
Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of supercomputers. In this article, wepresent dmodc, a fast deterministic routing algorithmfor parallel generalized fat trees (PGFTs), whichminimizes congestion risk even undermassive network degradation caused by equipment failure. dmodc computes forwarding tables witha closed-formarithmetic formula by relying on a fast preprocessing phase. This allowscomplete rerouting of networks with tens of thousands of nodes in less than a second. In turn, this greatly helps centralized fabric management react to faults with high-quality routing tables and has no impact on running applications in current and future very large scale high-performance computing clusters.
暂无评论