Nandakishore Santhi
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
Nandakishore Santhi has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Stephan Eidenbenz
Los Alamos National Laboratory
19 shared publications - Abdel-Hameed A. Badawy
Florida International University, USA
15 shared publications - Gopinath Chennupati
Los Alamos National Laboratory, Los Alamos, USA
13 shared publications Stephan Eidenbenz
Los Alamos National Laboratory, Los Alamos, USA
11 shared publicationsGopinath Chennupati
Los Alamos National Laboratory
8 shared publications- Yehia Arafa
New Mexico State University Las Cruces NM USA
7 shared publications
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. 197-206
Scalable Analytical Memory Modeling of AI Accelerators
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 197-206
Open AccessScalable Analytical Memory Modeling of AI Accelerators
- 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
Static Estimation of Reuse Profiles for Arrays in Nested Loops
Efficient memory access patterns play a crucial role in determining the overall performance of applications by exploiting temporal and spatial locality, thus maximizing cache locality. The Reuse Distance Histogram (RDH) is a widely used metric to quantify temporal locality, measuring the distance between consecutive accesses to the same memory location. Traditionally, calculating RDH requires program execution and memory trace collection to obtain dynamic memory access behavior. This trace collection is often time-consuming, resource-intensive, and unsuitable for early-stage optimization or large-scale applications. Static prediction, on the other hand, offers a significant speedup in estimating RDH and cache hit rates. However, these approaches lack accuracy, since the predictions come without running the program and knowing the complete memory access pattern, more specifically when arrays are used inside nested loops. This paper presents a novel static analysis framework for predicting the reuse profiles of array references in programs with nested loop structures, without requiring any runtime information. By analyzing loop bounds, access patterns in smaller problem sizes, and predictive equations, our method predicts access patterns of arrays and estimates reuse distances and cache hit rate at compile time. This paper extends our previous study by incorporating more analysis and improving prediction by addressing previously unhandled reuse patterns. We evaluate our technique against a widely accepted traditional trace-driven profiling tool, Parallel Reuse Distance Analysis (PARDA). The results demonstrate that our static predictor achieves comparable accuracy while offering orders-of-magnitude improvement in the analysis speed. This work offers a practical alternative to dynamic reuse profiling and paves the way for integration into compilers and static performance modeling tools.
Open AccessStatic Estimation of Reuse Profiles for Arrays in Nested Loops
Efficient memory access patterns play a crucial role in determining the overall performance of applications by exploiting temporal and spatial locality, thus maximizing cache locality. The Reuse Distance Histogram (RDH) is a widely used metric to quantify temporal locality, measuring the distance between consecutive accesses to the same memory location. Traditionally, calculating RDH requires program execution and memory trace collection to obtain dynamic memory access behavior. This trace collection is often time-consuming, resource-intensive, and unsuitable for early-stage optimization or large-scale applications. Static prediction, on the other hand, offers a significant speedup in estimating RDH and cache hit rates. However, these approaches lack accuracy, since the predictions come without running the program and knowing the complete memory access pattern, more specifically when arrays are used inside nested loops. This paper presents a novel static analysis framework for predicting the reuse profiles of array references in programs with nested loop structures, without requiring any runtime information. By analyzing loop bounds, access patterns in smaller problem sizes, and predictive equations, our method predicts access patterns of arrays and estimates reuse distances and cache hit rate at compile time. This paper extends our previous study by incorporating more analysis and improving prediction by addressing previously unhandled reuse patterns. We evaluate our technique against a widely accepted traditional trace-driven profiling tool, Parallel Reuse Distance Analysis (PARDA). The results demonstrate that our static predictor achieves comparable accuracy while offering orders-of-magnitude improvement in the analysis speed. This work offers a practical alternative to dynamic reuse profiling and paves the way for integration into compilers and static performance modeling tools.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 29-33
Generative Discrete Event Process Simulation for Hidden Markov Models to Predict Competitor Time-to-Market
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 29-33
Open AccessGenerative Discrete Event Process Simulation for Hidden Markov Models to Predict Competitor Time-to-Market
- Open Access
Scalable, Symbiotic, AI and Non-AI Agent Based Parallel Discrete Event Simulations
To fully leverage the potential of artificial intelligence (AI) systems in a trustworthy manner, it is desirable to couple multiple AI and non-AI systems together seamlessly for constraining and ensuring correctness of the output. This paper introduces a novel parallel discrete event simulation (PDES) based methodology to combine multiple AI and non-AI agents in a causal, rule-based way. Our approach tightly integrates the concept of passage of time, with each agent considered as an entity in the PDES framework and responding to prior requests from other agents. Such coupling mechanism enables the agents to work in a co-operative environment towards a common goal while many tasks run in parallel throughout the simulation. It further enables setting up boundaries to the outputs of the AI agents by applying necessary dynamic constraints using non-AI agents while allowing for scalability through deployment of hundreds of such agents in a larger compute cluster. Distributing smaller AI agents can enable extremely scalable simulations in the future, addressing local memory bottlenecks for model parameter storage. Within a PDES involving both AI and non-AI agents, we break down the problem at hand into structured steps, when necessary, providing a set of multiple choices to the AI agents, and then progressively solve these steps towards a final goal. At each step, the non-AI agents act as unbiased auditors, verifying each action by the AI agents so that certain rules of engagement are followed. We evaluate our approach by solving four problems from four different domains and comparing the results with those from AI models alone. Our results show greater accuracy in solving problems from various domains where the AI models struggle to solve the problems solely by themselves. Results show that overall accuracy of our approach is 68% where as the accuracy of vanilla models is less than 23%.
Open AccessScalable, Symbiotic, AI and Non-AI Agent Based Parallel Discrete Event Simulations
To fully leverage the potential of artificial intelligence (AI) systems in a trustworthy manner, it is desirable to couple multiple AI and non-AI systems together seamlessly for constraining and ensuring correctness of the output. This paper introduces a novel parallel discrete event simulation (PDES) based methodology to combine multiple AI and non-AI agents in a causal, rule-based way. Our approach tightly integrates the concept of passage of time, with each agent considered as an entity in the PDES framework and responding to prior requests from other agents. Such coupling mechanism enables the agents to work in a co-operative environment towards a common goal while many tasks run in parallel throughout the simulation. It further enables setting up boundaries to the outputs of the AI agents by applying necessary dynamic constraints using non-AI agents while allowing for scalability through deployment of hundreds of such agents in a larger compute cluster. Distributing smaller AI agents can enable extremely scalable simulations in the future, addressing local memory bottlenecks for model parameter storage. Within a PDES involving both AI and non-AI agents, we break down the problem at hand into structured steps, when necessary, providing a set of multiple choices to the AI agents, and then progressively solve these steps towards a final goal. At each step, the non-AI agents act as unbiased auditors, verifying each action by the AI agents so that certain rules of engagement are followed. We evaluate our approach by solving four problems from four different domains and comparing the results with those from AI models alone. Our results show greater accuracy in solving problems from various domains where the AI models struggle to solve the problems solely by themselves. Results show that overall accuracy of our approach is 68% where as the accuracy of vanilla models is less than 23%.
- Open Access
Comparison of Vectorization Capabilities of Different Compilers for X86 and ARM CPUs
Most modern processors contain vector units that simultaneously perform the same arithmetic operation over multiple sets of operands. The ability of compilers to automatically vectorize code is critical to effectively using these units. Understanding this capability is important for anyone writing compute-intensive, high-performance, and portable code. We tested the ability of several compilers to vectorize code on x86 and ARM. We used the TSVC2 suite, with modifications that made it more representative of real-world code. On x86, GCC reported 54% of the loops in the suite as having been vectorized, ICX reported 50%, and Clang, 46%. On ARM, GCC reported 56% of the loops as having been vectorized, ACFL reported 54%, and Clang, 47%. We found that the vectorized code did not always outperform the unvectorized code. In some cases, given two very similar vectorizable loops, a compiler would vectorize one but not the other. We also report cases where a compiler vectorized a loop on only one of the two platforms. Based on our experiments, we cannot definitively say if any one compiler is significantly better than the others at vectorizing code on any given platform.
Open AccessComparison of Vectorization Capabilities of Different Compilers for X86 and ARM CPUs
Most modern processors contain vector units that simultaneously perform the same arithmetic operation over multiple sets of operands. The ability of compilers to automatically vectorize code is critical to effectively using these units. Understanding this capability is important for anyone writing compute-intensive, high-performance, and portable code. We tested the ability of several compilers to vectorize code on x86 and ARM. We used the TSVC2 suite, with modifications that made it more representative of real-world code. On x86, GCC reported 54% of the loops in the suite as having been vectorized, ICX reported 50%, and Clang, 46%. On ARM, GCC reported 56% of the loops as having been vectorized, ACFL reported 54%, and Clang, 47%. We found that the vectorized code did not always outperform the unvectorized code. In some cases, given two very similar vectorizable loops, a compiler would vectorize one but not the other. We also report cases where a compiler vectorized a loop on only one of the two platforms. Based on our experiments, we cannot definitively say if any one compiler is significantly better than the others at vectorizing code on any given platform.
- Open Access
Static Reuse Profile Estimation for Array Applications
Reuse distance analysis is a widely recognized method for application characterization that illustrates cache locality. Although there are various techniques to calculate the reuse profile from dynamic memory traces, it is both time and space-consuming due to the requirement to collect dynamic memory traces at runtime. In contrast, static analysis reuse profile estimation is a promisingly faster approach since it is calculated at compile time without running the program or collecting memory traces. This work presents a static analysis technique to estimate the reuse profile of loop-based programs. For an input program, we generate a basic block-level control flow graph and the execution count by analyzing the LLVM IR of the program. We present the memory accesses of the application kernel in a compact bracketed format and use a recursive algorithm to predict the reuse distance histogram. We deploy a separate predictor that unrolls the loop(s) for smaller bounds and generates a temporary reuse distance profile for those small cases. Using these smaller profiles, the reuse profile is extrapolated for the actual loop bound(s). We use this reuse profile to predict the cache hit rate. Results show that our model can predict cache hit rates with an average accuracy of 95% relative to the dynamic reuse profile methods.
Open AccessStatic Reuse Profile Estimation for Array Applications
Reuse distance analysis is a widely recognized method for application characterization that illustrates cache locality. Although there are various techniques to calculate the reuse profile from dynamic memory traces, it is both time and space-consuming due to the requirement to collect dynamic memory traces at runtime. In contrast, static analysis reuse profile estimation is a promisingly faster approach since it is calculated at compile time without running the program or collecting memory traces. This work presents a static analysis technique to estimate the reuse profile of loop-based programs. For an input program, we generate a basic block-level control flow graph and the execution count by analyzing the LLVM IR of the program. We present the memory accesses of the application kernel in a compact bracketed format and use a recursive algorithm to predict the reuse distance histogram. We deploy a separate predictor that unrolls the loop(s) for smaller bounds and generates a temporary reuse distance profile for those small cases. Using these smaller profiles, the reuse profile is extrapolated for the actual loop bound(s). We use this reuse profile to predict the cache hit rate. Results show that our model can predict cache hit rates with an average accuracy of 95% relative to the dynamic reuse profile methods.
- Open Access
Generative Discrete Event Process Simulation for Hidden Markov Models to Predict Competitor Time-to-Market
We study the challenge of predicting the time at which a competitor product, such as a novel high-capacity EV battery or a new car model, will be available to customers; as new information is obtained, this time-to-market estimate is revised. Our scenario is as follows: We assume that the product is under development at a Firm B, which is a competitor to Firm A; as they are in the same industry, Firm A has a relatively good understanding of the processes and steps required to produce the product. While Firm B tries to keep its activities hidden (think of stealth-mode for start-ups), Firm A is nevertheless able to gain periodic insights by observing what type of resources Firm B is using. We show how Firm A can build a model that predicts when Firm B will be ready to sell its product; the model leverages knowledge of the underlying processes and required resources to build a Parallel Discrete Simulation (PDES)-based process model that it then uses as a generative model to train a Hidden Markov Model (HMM). We study the question of how many resource observations Firm A requires in order to accurately assess the current state of development at Firm B. In order to gain general insights into the capabilities of this approach, we study the effect of different process graph densities, different densities of the resource-activity maps, etc., and also scaling properties as we increase the number resource counts. We find that in most cases, the HMM achieves a prediction accuracy of 70 to 80 percent after 20 (daily) observations of a production process that lasts 150 days on average and we characterize the effects of different problem instance densities on this prediction accuracy. Our results give insight into the level of market knowledge required for accurate and early time-to-market prediction.
Open AccessGenerative Discrete Event Process Simulation for Hidden Markov Models to Predict Competitor Time-to-Market
We study the challenge of predicting the time at which a competitor product, such as a novel high-capacity EV battery or a new car model, will be available to customers; as new information is obtained, this time-to-market estimate is revised. Our scenario is as follows: We assume that the product is under development at a Firm B, which is a competitor to Firm A; as they are in the same industry, Firm A has a relatively good understanding of the processes and steps required to produce the product. While Firm B tries to keep its activities hidden (think of stealth-mode for start-ups), Firm A is nevertheless able to gain periodic insights by observing what type of resources Firm B is using. We show how Firm A can build a model that predicts when Firm B will be ready to sell its product; the model leverages knowledge of the underlying processes and required resources to build a Parallel Discrete Simulation (PDES)-based process model that it then uses as a generative model to train a Hidden Markov Model (HMM). We study the question of how many resource observations Firm A requires in order to accurately assess the current state of development at Firm B. In order to gain general insights into the capabilities of this approach, we study the effect of different process graph densities, different densities of the resource-activity maps, etc., and also scaling properties as we increase the number resource counts. We find that in most cases, the HMM achieves a prediction accuracy of 70 to 80 percent after 20 (daily) observations of a production process that lasts 150 days on average and we characterize the effects of different problem instance densities on this prediction accuracy. Our results give insight into the level of market knowledge required for accurate and early time-to-market prediction.