Atanu Barai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Atanu Barai has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Nandakishore Santhi
Los Alamos National Laboratory, Los Alamos, NM, USA
6 shared publications - Abdel-Hameed A. Badawy
Florida International University, USA
5 shared publications - Abdur Razzak
Computer Science, New Mexico State University, Las Cruces, NM, USA
3 shared publications - Stephan Eidenbenz
Los Alamos National Laboratory
2 shared publications - Yehia Arafa
New Mexico State University Las Cruces NM USA
2 shared publications - Farzad Fatollahi-Fard
Lawrence Berkeley National Laboratory (LBNL), Berkeley, California, USA
1 shared publication
Latest Publications
- Open Access
- 26 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
PPT-GPU 2.0: A Validated, Accurate, and Scalable Modeling of NVIDIA GPUs
Performance modeling and simulation tools (ModSim) for GPUs continue to be indispensable for performance optimization and a deeper understanding of their complex behaviors and architectures. We detail PPT-GPU 2.0, highlighting significant updates and improvements to PPT-GPU. These include a detailed modeling of the Ampere architecture, including shared memory and tensor cores, while extending coverage across Volta, Turing, and Ampere. Furthermore, we introduce a new GPU occupancy model, “Balance Model”. New performance metrics are also incorporated, including the maximum/minimum number of blocks executed concurrently per streaming Multiprocessor, and the active cycles for each execution pipeline. We evaluate PPT-GPU 2.0 on A100 GPUs, an Ampere architecture. We validate the results using a diverse set of benchmarks compared against real hardware, utilizing NVIDIA Nsight Compute, Accel-Sim (a cycle-accurate simulator), and HyFiSS. PPT-GPU 2.0 demonstrates notable accuracy improvements. For instance, it achieves an average error of 16.4% for active cycles, 9.3% for standard execution pipelines and 5.7% for tensor cores, while maintaining high accuracy for memory hierarchy (8% L1, 21.4% L2 hit rates, and 16.4% for IPC) and execution pipeline modeling. It achieves a 33.51x speedup in simulation time compared with Accel-Sim.
- 26 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
Open AccessPPT-GPU 2.0: A Validated, Accurate, and Scalable Modeling of NVIDIA GPUs
Performance modeling and simulation tools (ModSim) for GPUs continue to be indispensable for performance optimization and a deeper understanding of their complex behaviors and architectures. We detail PPT-GPU 2.0, highlighting significant updates and improvements to PPT-GPU. These include a detailed modeling of the Ampere architecture, including shared memory and tensor cores, while extending coverage across Volta, Turing, and Ampere. Furthermore, we introduce a new GPU occupancy model, “Balance Model”. New performance metrics are also incorporated, including the maximum/minimum number of blocks executed concurrently per streaming Multiprocessor, and the active cycles for each execution pipeline. We evaluate PPT-GPU 2.0 on A100 GPUs, an Ampere architecture. We validate the results using a diverse set of benchmarks compared against real hardware, utilizing NVIDIA Nsight Compute, Accel-Sim (a cycle-accurate simulator), and HyFiSS. PPT-GPU 2.0 demonstrates notable accuracy improvements. For instance, it achieves an average error of 16.4% for active cycles, 9.3% for standard execution pipelines and 5.7% for tensor cores, while maintaining high accuracy for memory hierarchy (8% L1, 21.4% L2 hit rates, and 16.4% for IPC) and execution pipeline modeling. It achieves a 33.51x speedup in simulation time compared with Accel-Sim.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1712-1722
Bridging Simulation and Silicon: A Study of RISC-V Hardware and FireSim Simulation
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1712-1722
Open AccessBridging Simulation and Silicon: A Study of RISC-V Hardware and FireSim Simulation
- Open Access
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 226-237
Compile Time Prediction of Cache Reuse for Array Applications with Multiple Loop Nests
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 226-237
Open AccessCompile Time Prediction of Cache Reuse for Array Applications with Multiple Loop Nests
- Open Access
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-244
Static Reuse Profile Estimation for Array Applications
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-244
Open AccessStatic Reuse Profile Estimation for Array Applications
- Open Access
- 2 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
LLVM Static Analysis for Program Characterization and Memory Reuse Profile Estimation
Profiling various application characteristics, including the number of different arithmetic operations performed, memory footprint, etc., dynamically is time- and space-consuming. On the other hand, static analysis methods, although fast, can be less accurate. This paper presents an LLVM-based probabilistic static analysis method that accurately predicts different program characteristics and estimates the reuse distance profile of a program by analyzing the LLVM IR file in constant time, regardless of program input size. We generate the basic-block-level control flow graph of the target application kernel and determine basic-block execution counts by solving the linear balance equation involving the adjacent basic blocks’ transition probabilities. Finally, we represent the kernel memory accesses in a bracketed format and employ a recursive algorithm to calculate the reuse distance profile. The results show that our approach can predict application characteristics accurately compared to another LLVM-based dynamic code analysis tool, Byfl.
- 2 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessLLVM Static Analysis for Program Characterization and Memory Reuse Profile Estimation
Profiling various application characteristics, including the number of different arithmetic operations performed, memory footprint, etc., dynamically is time- and space-consuming. On the other hand, static analysis methods, although fast, can be less accurate. This paper presents an LLVM-based probabilistic static analysis method that accurately predicts different program characteristics and estimates the reuse distance profile of a program by analyzing the LLVM IR file in constant time, regardless of program input size. We generate the basic-block-level control flow graph of the target application kernel and determine basic-block execution counts by solving the linear balance equation involving the adjacent basic blocks’ transition probabilities. Finally, we represent the kernel memory accesses in a bracketed format and employ a recursive algorithm to calculate the reuse distance profile. The results show that our approach can predict application characteristics accurately compared to another LLVM-based dynamic code analysis tool, Byfl.
- 28 June 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (2) , 2354-2385
PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling
- 28 June 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (2) , 2354-2385
PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling