Bharath Ramesh

Bharath Ramesh

Auto-generated profile, based on publicly available information

Bharath Ramesh

Ohio State University, Columbus, Ohio, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 June 2023
Verified
Conference Paper
Open access
NCNicholas Contini
Nicholas Contini
BRBharath Ramesh
Bharath Ramesh
KSKaushik Kandadi Suresh
Kaushik Kandadi Suresh
TTTu Tran
Tu Tran
BMBen Michalowicz
Ben Michalowicz
DPDhabaleswar Panda
Dhabaleswar Panda

1 May 2020
Verified
Conference Paper
Closed access
JHJahanzeb Maqbool Hashmi
Jahanzeb Maqbool Hashmi
SXShulei Xu
Shulei Xu
BRBharath Ramesh
Bharath Ramesh
MBMohammadreza Bayatpour
Mohammadreza Bayatpour
HSHari Subramoni
Hari Subramoni
DPDhabaleswar K. Dk Panda
Dhabaleswar K. Dk Panda
Modern multi-/many-cores offer higher core-density, hardware multi-threading, deeper memory hierarchies, and diverse architectural capabilities. While emerging cloud-based HPC systems are able to deliver near-native performance, they bring more diversity to the architectures. The Message Passing Interface (MPI) offers the flexibility to arbitrarily bind application processes to CPU cores, however the static nature of these binding policies typically does not take applications’ communication patterns and underlying machine architecture into consideration. This lack of association between the dynamic nature of applications and architectural diversity offered by modern processors makes it difficult for the application developers and MPI designers to exploit modern multi-/many-core systems to their full potential. In this paper, we propose a set of low-level benchmarking based approaches and MPI-level designs to infer vendor-specific machine characteristics e.g., physical to virtual machine topologies, and dynamic communication patterns of the applications. By utilizing this information, we propose two novel algorithms to construct efficient MPI mappings for any given architecture and application communication pattern. The proposed designs are implemented in the MVAPICH2 MPI library and are evaluated on three different architectures using various micro-benchmarks and application kernels. We demonstrate up to 2X performance improvement for MPI collectives, and up to 3.5X and 26% improvement for NAS-CG and miniAMR application kernels, respectively.

15 November 2025
Verified
Conference Paper
Open access
NCNicholas Contini
Nicholas Contini
JQJake Queiser
Jake Queiser
BRBharath Ramesh
Bharath Ramesh
HSHari Subramoni
Hari Subramoni
DPDhabaleswar K. Panda
Dhabaleswar K. Panda

1 December 2021
Verified
Conference Paper
Closed access
KSKaushik Kandadi Suresh
Kaushik Kandadi Suresh
BRBharath Ramesh
Bharath Ramesh
CCChen Chun Chen
Chen Chun Chen
SGSeyedeh Mahdieh Ghazimirsaeed
Seyedeh Mahdieh Ghazimirsaeed
MBMohammadreza Bayatpour
Mohammadreza Bayatpour
DPDhabaleswar K. Panda
Dhabaleswar K. Panda
Modern MPI-based scientific applications frequently use derived datatypes (DDT) for inter-process communication. Designing scalable solutions capable of dynamically adapting themselves to the complex communication requirements posed by DDT-based applications bring forth several new challenges. In this work, we address these challenges and propose solutions to efficiently improve the performance of hardware-assisted datatype transfers. Further, we design a layout-aware DDT scheme that dynamically adapts the datatype processing to the communication requirements of the datatype layouts used by the application. The proposed layout-aware adaptive scheme is able to dynamically switch between different host-based and the proposed hardware-assisted schemes to deliver the best performance and scalability while hiding the communication overheads. The experimental evaluations on multiple HPC systems including Frontera at TACC and Expanse at SDSC show that our proposed designs achieve up to 22 % improvement in performance over state-of-the-art MPI libraries at the micro-benchmark level. We also evaluate our designs with various scientific application kernels such as MILC, WRF, and applications such as miniGhost and demonstrate up to 9 % improvement in performance at 128 nodes for the miniGhost application.

8 January 2025 in IEEE Micro
Verified
Journal Article
Closed access
TTTu Tran
Tu Tran
GKGoutham Kalikrishna Reddy Kuncham
Goutham Kalikrishna Reddy Kuncham
BRBharath Ramesh
Bharath Ramesh
SXShulei Xu
Shulei Xu
HSHari Subramoni
Hari Subramoni
DPDhabaleswar K. Dk Panda
Dhabaleswar K. Dk Panda
The presence of exascale computers has pushed a new boundary in computing capability, posing performance challenges in parallel programming models on how to exploit such systems efficiently. The Message Passing Interface (MPI) is a dominant model for parallel programming. Among its primitives, MPI_Alltoall is a communication-intensive operation widely employed in numerous applications, yet it remains challenging to optimize. Alltoall algorithms are mainly classified into flat and hierarchical. The hierarchical designs avoid the slowdown of intra/inter-node communication by decoupling them. Hierarchical designs also reduce network congestion by limiting concurrently injected messages. This work demonstrates hierarchical designs also improve connection scalability in RDMA networks. This improvement is attributed to the cache thrashing happening inside network adapters. All of these advantages of hierarchical schemes collectively contribute to the network scalability of Alltoall. We propose and evaluate a network-agnostic design on InfiniBand and Omni-Path clusters, showing benefits at both micro-benchmark and application levels over other MPI libraries.