33 results on '"Santhi, Nandakishore"'
Search Results
2. Quantum Netlist Compiler (QNC)
3. Demystifying the Nvidia Ampere Architecture through Microbenchmarking and Instruction-level Analysis
4. Hybrid, scalable, trace-driven performance modeling of GPGPUs
5. Load-Aware Dynamic Time Synchronization in Parallel Discrete Event Simulation
6. PPT-SASMM: Scalable Analytical Shared Memory Model
7. NVIDIA GPGPUs Instructions Energy Consumption
8. Fast, accurate, and scalable memory modeling of GPGPUs using reuse profiles
9. Verified instruction-level energy consumption measurement for NVIDIA GPUs
10. GPUs Cache Performance Estimation using Reuse Distance Analysis
11. Low Overhead Instruction Latency Characterization for NVIDIA GPGPUs
12. POSTER: GPUs Pipeline Latency Analysis
13. Scalable Performance Prediction of Codes with Memory Hierarchy and Pipelines
14. JUST-IN-TIME PARALLEL SIMULATION
15. PPT-GPU
16. Parallel Application Performance Prediction Using Analysis Based Models and HPC Simulations
17. Probabilistic Monte Carlo simulations for static branch prediction
18. An analytical memory hierarchy model for performance prediction
19. AMM: Scalable Memory Reuse Model to Predict the Performance of Physics Codes
20. A Probabilistic Monte Carlo Framework for Branch Prediction
21. An Integrated Interconnection Network Model for Large-Scale Performance Prediction
22. GPU Performance Prediction Through Parallel Discrete Event Simulation and Common Sense
23. The Simian concept: Parallel Discrete Event Simulation with interpreted languages and just-in-time compilation
24. Simian integrated framework for parallel discrete event simulation on GPUS
25. An Integrated Interconnection Network Model for Large-Scale Performance Prediction.
26. Parameterized benchmarking of parallel discrete event simulation systems: Communication, computation, and memory.
27. CyberSim: Geographic, temporal, and organizational dynamics of malware propagation
28. Sparse representations for codes and the hardness of decoding LDPC codes
29. On Algebraic Decoding of q-ary Reed-Muller and Product Reed-Solomon Codes
30. Minimum Distance of Codes and Their Branching Program Complexity
31. Cybersim.
32. Optimization principles for arithmetic functions in hardware-software co-design.
33. "ON ALGEBRAIC DECODING OF Q-ARY REED-MULLER AND PRODUCT REED-SOLOMON CODES"
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.