GPU friendly fast Poisson solver for structured power grid network analysis

  • Authors:
  • Jin Shi;Yici Cai;Wenting Hou;Liwei Ma;Sheldon X.-D. Tan;Pei-Hsin Ho;Xiaoyi Wang

  • Affiliations:
  • Tsinghua University, PRC;Tsinghua University, PRC;Synopsys. Inc.;Synopsys. Inc.;University of California, Riverside, CA;Synopsys. Inc.;Tsinghua University, PRC

  • Venue:
  • Proceedings of the 46th Annual Design Automation Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dimension Poisson equation and solves it using an analytical expressions based on FFT technique. The computation complexity of the new algorithm is O(NlgN), which is much smaller than the traditional solver's complexity O(N1.5) for sparse matrices, such as the SuperLU solver and the PCG solver. Also, due to the special formulation, graphic process unit (GPU) can be explored to further speed up the algorithm. Experimental results show that the new algorithm is stable and can achieve 100X speed up on GPU over the widely used SuperLU solver with very little memory footprint.