Aniruddha Marathe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aniruddha Marathe has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Tapasya Patki
Lawrence Livermore National Laboratory, Livermore, USA
3 shared publications - Kathleen Shoga
Lawrence Livermore National Laboratory, Livermore, USA
2 shared publications - Tanzima Zerin Islam
Texas State University
2 shared publications - Aakash Raj Dhakal
Texas State University, San Marcos, TX, USA
1 shared publication - Abhik Sarkar
Lawrence Livermore National Laboratory (LLNL), Livermore, California, USA
1 shared publication - Abhinav Bhatele
Department of Computer Science, University of Maryland, College Park, MD, USA
1 shared publication
Latest Publications
- 5 March 2026
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (3) , 404-420
Data-driven analysis to understand GPU hardware resource usage of optimizations
With heterogeneous systems, the number of GPUs per chip increases to provide computational capabilities for solving science at a nanoscopic scale. However, low utilization for single GPUs defies the need to invest more money in expensive accelerators. Although related work develops optimizations to improve application performance, none studies how these optimizations impact hardware resource usage or average GPU utilization. This paper takes a data-driven analysis approach in addressing this gap by (1) characterizing how hardware resource usage affects device utilization, execution time, or both, (2) presenting a multiobjective metric to identify important application-device interactions that can be optimized to improve device utilization and application performance jointly, (3) studying hardware resource usage behaviors of several optimizations for a benchmark application, and finally (4) identifying optimization opportunities for several scientific proxy applications based on their hardware resource usage behaviors. Furthermore, we demonstrate the applicability of our methodology by applying the identified optimizations to a proxy application, which improves the execution time, device utilization, and power consumption by up to 29.6%, 5.3% and 26.5% respectively.
- 5 March 2026
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (3) , 404-420
Data-driven analysis to understand GPU hardware resource usage of optimizations
With heterogeneous systems, the number of GPUs per chip increases to provide computational capabilities for solving science at a nanoscopic scale. However, low utilization for single GPUs defies the need to invest more money in expensive accelerators. Although related work develops optimizations to improve application performance, none studies how these optimizations impact hardware resource usage or average GPU utilization. This paper takes a data-driven analysis approach in addressing this gap by (1) characterizing how hardware resource usage affects device utilization, execution time, or both, (2) presenting a multiobjective metric to identify important application-device interactions that can be optimized to improve device utilization and application performance jointly, (3) studying hardware resource usage behaviors of several optimizations for a benchmark application, and finally (4) identifying optimization opportunities for several scientific proxy applications based on their hardware resource usage behaviors. Furthermore, we demonstrate the applicability of our methodology by applying the identified optimizations to a proxy application, which improves the execution time, device utilization, and power consumption by up to 29.6%, 5.3% and 26.5% respectively.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 135-150
Usability Evaluation of Cloud for HPC Applications
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 135-150
Open AccessUsability Evaluation of Cloud for HPC Applications
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
ModelX : A Novel Transfer Learning Approach Across Heterogeneous Datasets
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessModelX : A Novel Transfer Learning Approach Across Heterogeneous Datasets
- Open Access
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 696-703
msr-genie: Navigating Model Specific Registers Across Processor Generations
Performance tuning of High-Performance Computing (HPC) applications depends on sophisticated tuning of parameters on diverse architectures. These parameters are made available by vendors through low-level dials such as model-specific registers (MSRs). While the MSRs themselves provide a powerful mechanism for users to monitor and control processor features, accessing them is laborious due to lack of standard interfaces and clear documentation. As a result, the burden of determining which MSRs to consider and how to fine-tune them for an application lies with the end user. In this paper, we present msr-genie, an efficient and extensible query tool that reduces this user-level burden. The tool allows them to query bi-directionally across MSR lists as well as processor families and models, and provides them with guidance on appropriate bitmasks. The msr-genie tool is open-source and easily extensible, and we demonstrate its effectiveness with over thirty Intel processor models and over two-thousand unique MSRs.
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 696-703
Open Accessmsr-genie: Navigating Model Specific Registers Across Processor Generations
Performance tuning of High-Performance Computing (HPC) applications depends on sophisticated tuning of parameters on diverse architectures. These parameters are made available by vendors through low-level dials such as model-specific registers (MSRs). While the MSRs themselves provide a powerful mechanism for users to monitor and control processor features, accessing them is laborious due to lack of standard interfaces and clear documentation. As a result, the burden of determining which MSRs to consider and how to fine-tune them for an application lies with the end user. In this paper, we present msr-genie, an efficient and extensible query tool that reduces this user-level burden. The tool allows them to query bi-directionally across MSR lists as well as processor families and models, and provides them with guidance on appropriate bitmasks. The msr-genie tool is open-source and easily extensible, and we demonstrate its effectiveness with over thirty Intel processor models and over two-thousand unique MSRs.
- 1 November 2020
- Published by Elsevier in Parallel Computing
- Vol. 99, 102686
Dynamic power management for value-oriented schedulers in power-constrained HPC system
- 1 November 2020
- Published by Elsevier in Parallel Computing
- Vol. 99, 102686
Dynamic power management for value-oriented schedulers in power-constrained HPC system
- Open Access
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 733-739
Profile Guided MPI Protocol Selection for Point-to-Point Communication Calls
Improving communication performance is critical to achieving high performance in message-passing programs. Designing new, efficient protocols to realize point-to-point and collective communication operations has therefore been an active area of research. However, the best protocol for a given communication routine is both application and architecture specific. This paper contributes a new method of selection of the optimal protocol for a given point-to-point communication pair. Our technique analyzes the MPI communication call profile of an application and uses a computation and communication model we have developed to choose the proper protocol for each communication phase. We have applied our system to MPI applications such as CG, Sweep3D and Sparse Matrix multiplication, as well as synthetic applications. Our scheme yields an improvement in total execution time of up to 20% compared to MVAPICH2 and up to 3.2% compared to the best, highly optimized communication protocol for the real applications. Furthermore, experiments on the synthetic applications show that the savings can be much more pronounced.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 733-739
Open AccessProfile Guided MPI Protocol Selection for Point-to-Point Communication Calls
Improving communication performance is critical to achieving high performance in message-passing programs. Designing new, efficient protocols to realize point-to-point and collective communication operations has therefore been an active area of research. However, the best protocol for a given communication routine is both application and architecture specific. This paper contributes a new method of selection of the optimal protocol for a given point-to-point communication pair. Our technique analyzes the MPI communication call profile of an application and uses a computation and communication model we have developed to choose the proper protocol for each communication phase. We have applied our system to MPI applications such as CG, Sweep3D and Sparse Matrix multiplication, as well as synthetic applications. Our scheme yields an improvement in total execution time of up to 20% compared to MVAPICH2 and up to 3.2% compared to the best, highly optimized communication protocol for the real applications. Furthermore, experiments on the synthetic applications show that the savings can be much more pronounced.