NKNurdaulet Kabdygaliyev
Nurdaulet Kabdygaliyev
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nurdaulet Kabdygaliyev has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Akmaral Abdigaliyeva
Atyrau Oil and Gas University named after Safi Utebayev,Faculty of Information Technologies,Atyrau,Kazakhstan
1 shared publication - Bazargul Matkerim
Department of Computer Science, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan
1 shared publication - Farida Izgaliyeva
Atyrau Oil and Gas University named after Safi Utebayev,Faculty of Information Technologies,Atyrau,Kazakhstan
1 shared publication - Gulnaz Dossanova
Atyrau Oil and Gas University named after Safi Utebayev,Faculty of Information Technologies,Atyrau,Kazakhstan
1 shared publication - Moldir Nakibayeva
Department of Computer Science, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan
1 shared publication - Nurislam Kassymbek
Department of Computer Science, Al-Farabi Kazakh National University, Almaty 050040, Kazakhstan
1 shared publication
Latest Publications
- Open Access
- 18 November 2026
- Published by MDPI AG in Computation
- Vol. 14 (11) , 297
Automatic Generation of GPU Code Using Multi-Dimensional Homomorphisms: A Conjugate-Gradient Case Study
Developing efficient, performance-portable GPU code for multi-stage numerical pipelines is difficult; automated compilers struggle to parallelize them. We address this using Multi-Dimensional Homomorphisms (MDH), generating correct-by-construction GPU code from high-level formulations, tuned via an automated (scripted) sweep, cross-checked against the auto-tuning framework (ATF). We apply this to the conjugate-gradient (CG) method for the matrix-free 2D/3D Poisson equation, generating the stencil, dot product, and vector update; CG is not claimed to be the fastest algorithm for this problem, addressed via a multigrid comparison. On two NVIDIA GPUs (RTX 3050 Laptop, RTX 5090), up to 268 million unknowns, tuned MDH kernels take 0.91 to 1.12 times the time of a hand-tuned kernel, and PPCG with tuned tile and block sizes takes 0.83 to 1.09 times the time of tuned MDH, neither uniformly faster; the up-to-8× gap against PPCG’s default schedule comes from engaging a single streaming multiprocessor. The fully generated GPU-resident CG iteration, run to convergence, is 1.62 to 1.99 times faster than CSR and cuSPARSE beyond the cache. A geometric multigrid solver, run to CG’s own accuracy target, outperforms all CG variants by 1.6× to 5.3×; ILU(0) preconditioning reduces iteration counts but increases wall-clock time.- 18 November 2026
- Published by MDPI AG in Computation
- Vol. 14 (11) , 297
Open AccessAutomatic Generation of GPU Code Using Multi-Dimensional Homomorphisms: A Conjugate-Gradient Case Study
Developing efficient, performance-portable GPU code for multi-stage numerical pipelines is difficult; automated compilers struggle to parallelize them. We address this using Multi-Dimensional Homomorphisms (MDH), generating correct-by-construction GPU code from high-level formulations, tuned via an automated (scripted) sweep, cross-checked against the auto-tuning framework (ATF). We apply this to the conjugate-gradient (CG) method for the matrix-free 2D/3D Poisson equation, generating the stencil, dot product, and vector update; CG is not claimed to be the fastest algorithm for this problem, addressed via a multigrid comparison. On two NVIDIA GPUs (RTX 3050 Laptop, RTX 5090), up to 268 million unknowns, tuned MDH kernels take 0.91 to 1.12 times the time of a hand-tuned kernel, and PPCG with tuned tile and block sizes takes 0.83 to 1.09 times the time of tuned MDH, neither uniformly faster; the up-to-8× gap against PPCG’s default schedule comes from engaging a single streaming multiprocessor. The fully generated GPU-resident CG iteration, run to convergence, is 1.62 to 1.99 times faster than CSR and cuSPARSE beyond the cache. A geometric multigrid solver, run to CG’s own accuracy target, outperforms all CG variants by 1.6× to 5.3×; ILU(0) preconditioning reduces iteration counts but increases wall-clock time.