Accelerating GPGPU Simulation by Strategically Parallelizing the Compute Bottleneck
Abstract
Cycle-accurate GPGPU simulators like GPGPU-Sim provide invaluable insights for hardware architecture research but suffer from extremely long runtimes, hindering research productivity. This paper addresses this critical bottleneck by proposing a strategy to accelerate GPGPU-Sim. We first perform a holistic profiling analysis across diverse GPGPU benchmarks to identify the primary performance bottleneck, pinpointing the SIMT-Core cluster execution within the CORE-clock cycle. Based on this, we implement a parallelization scheme that strategically targets this hotspot, utilizing a thread pool to manage concurrent execution of SIMT-Core clusters. Our approach prioritizes minimal modifications to the existing GPGPU-Sim codebase to ensure long-term maintainability. Evaluation of a simulated NVIDIA H100 model demonstrates an average simulation wall-time speedup of 3.58× with 8 worker threads, and a maximum up to 4.38×, while incurring a maximum cycle count error of 3.22%, with some other benchmarks exhibiting no error at all.
Fields of Study & Subjects
Parallel Computing and Optimization Techniques
Cloud Computing and Resource Management
Distributed and Parallel Computing Systems
Publication details
- Journal / source
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
- Publication date
- 1 January 2026
- Language
- EN