Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Santosh Mahapatra

dblp:33/10102 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0001-7557-2263ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 56% Internet architecture and protocols · 44%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
network topology
0.212013
A new routing scheme for Jellyfish and its performance with HPC workloads · SC 2013
Routing and switching › routing
routing schemes
0.212013
A new routing scheme for Jellyfish and its performance with HPC workloads · SC 2013
Interconnection networks and networks-on-chip
topology comparison
0.212013
A new routing scheme for Jellyfish and its performance with HPC workloads · SC 2013

Methods — techniques the papers use, named apart from their topics

routing scheme design · 0.3performance comparison · 0.3
YearPublicationVenuePosition
2014 LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems
abstract
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 not directly related to application level communication performance while the simulation complexity limits the number of scenarios that can be investigated. In this work, we propose a new performance metric, called LANL-FSU Throughput Indices (LFTI), for characterizing the throughput performance of interconnect designs. LFTI combines the simplicity of topological parameters and the accuracy of simulation: like topological parameters, LFTI can be derived from interconnect specification, at the same time, it directly reflects the application level communication performance. Moreover, in cases when the theoretical throughput for each communication pattern can be modeled efficiently for an interconnect, LFTI for the interconnect can be computed efficiently. These features potentially allow LFTI to be used for rapid and comprehensive evaluation and comparison of extreme-scale interconnect designs. We demonstrate the effectiveness of LFTI by using it to evaluate and explore the design space of a number of large-scale interconnect designs.
Xin Yuan 0001, Santosh Mahapatra, Michael Lang 0003, Scott Pakin
IPDPS2
2014 Static load-balanced routing for slimmed fat-trees
Xin Yuan 0001, Santosh Mahapatra, Michael Lang 0003, Scott Pakin
J. Parallel Distributed Comput.2
2013 A new routing scheme for Jellyfish and its performance with HPC workloads
abstract
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 out-performs existing schemes by more effectively exploiting the path diversity, and comprehensively compare the performance of jellyfish and fat-tree topologies with HPC workloads. The results indicate that both jellyfish and fat-tree topologies offer comparable high performance for HPC workloads on systems that can be realized by 3-level fat-trees using the current technology and the corresponding jellyfish topologies with similar costs. Fat-trees are more effective for smaller systems while jellyfish is more scalable.
Xin Yuan 0001, Santosh Mahapatra, Wickus Nienaber, Scott Pakin, Michael Lang 0003
SC2