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 for such topologies are special cases of limited multi- path routing. We propose path calculation heuristics, including(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)
AIM To evaluate visual outcome following pars plana vitrectomy (PPV) and intraocular foreign body (IOFB) removal through the sclerocorneal tunnel combined with simultaneous cataract extraction and sulcus-fixated intraocular lens (IOL) implantation as a single procedure in penetrating ocular trauma with IOFB and traumatic cataract. MATERIALS AND METHODS(More)
Keywords: RFQ procurement Mathematical programming Multi-attribute bids Procurement a b s t r a c t Considering multiple attributes while evaluating request for quotes (RFQs) responses from suppliers is gaining significant importance in industrial procurement. While price has traditionally been the most important factor in evaluating RFQ responses,(More)
Traditionally, interconnect performance is either characterized by simple topological parameters such as bisection 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)
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)
• 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)
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)