Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Document Type
Conference Proceeding
Publication Date
9-7-2010
Abstract
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require incomplete matrix factorizations can not be effectively accelerated on GPU due to its limited hardware resource as well as data parallel computing. This work presents an efficient GPU-based multigrid preconditioning algorithm for robust power grid analysis. An ELL-like sparse matrix data structure is adopted and implemented specifically for power grid analysis to assure coalesced GPU device memory access and high arithmetic intensity. By combining the fast geometrical multigrid solver with the robust Krylov-subspace iterative solver, power grid DC and transient analysis can be performed efficiently on GPU without loss of accuracy (largest errors < 0.5 mV). Unlike previous GPU-based algorithms that rely on good power grid regularities, the proposed algorithm can be applied for more general power grid structures. Experimental results show that the DC and transient analysis on GPU achieves more than 25X speedups over the best available CPU-based solvers. An industrial power grid with 10.5 million nodes can be accurately solved in 12 seconds. Copyright 2010 ACM.
Publication Title
Proceedings - Design Automation Conference
Recommended Citation
Feng, Z.,
&
Zeng, Z.
(2010).
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis.
Proceedings - Design Automation Conference, 661-666.
http://doi.org/10.1145/1837274.1837443
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/12507