Santosh Mahapatra

Learn More
We consider a general form of routing, called limited multi-path routing, on extended generalized fat-trees where the number of paths between each pair of processing nodes is a parameter. Existing single-path routing and multi-path routing, where all available paths between a pair of processing nodes can be used for the traffic, are special cases of limited(More)
—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(More)
The jellyfish topology where switches are connected using a random graph has recently been proposed for large scale data-center networks. It has been shown to offer higher bisection bandwidth and better permutation throughput than the corresponding fat-tree topology with a similar cost. In this work, we propose a new routing scheme for jellyfish that(More)
Folded-Clos networks, also known as fat-trees, have been widely used as interconnects in large-scale high-performance computing clusters. Although users often treat such interconnects as replacements of nonblocking crossbar switches that can carry out any permutation communication without contention, the networking capability of such interconnects without a(More)
—Traditionally, interconnect performance is either characterized by simple topological parameters such as bi-section bandwidth or studied through simulation that gives detailed performance information for the scenarios simulated. Neither of these approaches provides a good performance overview for extreme-scale interconnects. The topological parameters are(More)
• A new load balanced routing scheme, RRR, for slimmed fat-trees. • A combined routing scheme that integrates RRR, D-mod-k, and S-mod-k. • Performance study. a b s t r a c t Slimmed fat-trees have recently been proposed and deployed to reduce costs in High Performance Computing (HPC) clusters. While existing static routing schemes such as destination-mod-k(More)
—Fat-trees are widely adopted in HPC systems. While existing static routing schemes such as destination-mod-k (D-mod-k) routing are load-balanced and effective for full bisection bandwidth fat-trees, they are not load-balanced for many slimmed fat-trees, which have recently been suggested to reduce costs in HPC systems. In this work, we propose a load(More)
  • 1