Skip to content

HIP-DFPT: Scalable Optimization of Irregular Workloads in Quantum Perturbation on GPU Clusters

Sep 2026 · IEEE Transactions on Parallel and Distributed Systems · Vol 37, pp. 2021-2036 · 3 citations · 54 references
Computer Science

Abstract

Irregular workloads challenge GPUs with small tasks, unpredictable branching, and uneven load distribution. Quantum perturbation theory and Density Functional Theory (DFT) represent a prominent example, where such irregular patterns arise in large-scale simulations of materials and molecules. Despite recent efforts to accelerate these simulations on GPUs, State-of-the-Art (SOTA) methods still suffer from low GPU utilization and severe load imbalance, which hinder efficiency and scalability. In this paper, we redesign the expression of the data structure and propose an efficient implementation for quantum perturbation named HIP-DFPT. A series of general GPU optimizations are proposed, including micro-task composition strategy, GPU memory management, and multi-stream pipelines. We present a branch-dominant hybrid online performance model to predict quickly and accurately with only 5% sampled data. Furthermore, we introduce a multi-level load balancing strategy guided by performance models for both inter-GPU and intra-GPU task distribution. Our experimental results on a large-scale GPU cluster show significant improvements in computational efficiency and scalability. Using up to 8192 GPUs for simulations with up to 200,006 atoms with all-electron precision, we achieve an average load balancing efficiency of 1.06, a 55% increase in GPU occupation, and a 70% enhancement in throughput.

View source

Similar papers

Sep 2026

Optimization and Analysis of Resource Allocation in Quantum-Centric Supercomputing Environments

Advances in quantum computing hardware and quantum algorithms are likely to cause major paradigm shifts in highperformance supercomputing environments. These shifts include foundational changes to system infrastructures that integrate both quantum and classical computational substrates through a combination of quantum...

M. Squillante, Asser N. Tantawi, Ming-Hung Chen · 0 citations
Open access Oct 2026

Demystifying SpMV Performance: Bottleneck Characterization and Open Challenges

Sparse Matrix-Vector Multiplication (SpMV) is a critical computational kernel in scientific computing, graph processing, and machine learning. Despite its importance, SpMV achieves only a small fraction of peak performance, varying substantially across matrices and architectures. This paper comprehensively analyzes SpM...

Panagiotis Mpakos, Dimitrios Galanopoulos, Petros Anastasiadis et al. · 0 citations
Preprint Aug 2026

Architecting the Next Generation of Asynchronous, Distributed GPUs for the AI Era

This work presents a cycle-level simulation framework designed to accurately model modern GPU generations, including Ampere, Hopper, and Blackwell, and conducts architectural case studies to evaluate emerging design trajectories, including chiplet topology scaling, expanded SRAM capacity and bandwidth, and inter-GPU pr...

Junrui Pan, Wei-Li An, Cesar Avalos Baddouh et al. · 2 citations · ⚡2

Breaking the Tradeoff: Elastic and Isolated GPU Sharing with Ghost

Ghost is an OS-level GPU virtualization layer integrated directly into the open-source GPU driver, using a GPU container abstraction with cgroup -like APIs for compute and memory control and privileged hardware-level scheduling and preemption for dynamic compute resource management.

Unknown authors · 0 citations
Preprint Sep 2026

Joint Effects of GPU Server Topology, Parallelism, and Congestion Control on MoE Inference: A Controlled Simulation Study

Mixture-of-experts (MoE) models expand capacity via sparse activation, but inference across GPUs introduces tensor-parallel (TP) collectives and expert-parallel (EP) dispatch and combine operations. Completion time depends not just on communication volume but on how logical groups map onto intra-server interconnects, G...

Kai-Kai Yuan, Rui Xi, Yu Liu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.