Coupling regular topologies with optimised routing algorithms is key in pushing the performance of interconnection networks of supercomputers.In this paper we present Dmodc, a fast deterministic routing algorithm for Parallel Generalised Fat-Trees (PGFTs) which minimises congestion risk even under massive network degradation caused by equipment failure.Dmodc computes forwarding tables with a closed-form arithmetic formula by relying on a fast preprocessing phase.This allows complete re-routing of networks with tens of thousands of nodes in less than a second.In turn, this greatly helps centralised fabric management react to faults with high-quality routing tables and no impact to running applications in current and future very large-scale HPC clusters.
@article{arxiv.2211.13101,
title = {High-Quality Fault Resiliency in Fat Trees},
author = {John Gliksberg and Antoine Capra and Alexandre Louvet and Pedro Javier Garcia and Devan Sohier},
journal= {arXiv preprint arXiv:2211.13101},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:2211.11817