Improving Performance of Deterministic Single-Path Routing on 2-Level Generalized Fat-Trees
Wickus Nienaber, Santosh Kumar Mahapatra, Xin Yuan · 2011
This paper focuses on deterministic single-path routing schemes on 2-level generalized fat-trees. We develop a routing algorithm that is optimal in terms of worst-case permutation performance. In comparison to existing routing schemes for such topologies, our algorithm also improves the average performance of common communication patterns including bisect patterns, full permutation patterns, and dissemination (Bruck) patterns on various 2-level generalized fat-trees as demonstrated in our evaluation results.