• DocumentCode
    3273560
  • Title

    In-depth Experimental Study of Power Grid Network Analysis Using Random Walks Algorithm

  • Author

    Kang, Le ; Cai, Yici ; Shi, Jin ; Hong, Xianlong

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing
  • Volume
    4
  • fYear
    2006
  • fDate
    25-28 June 2006
  • Firstpage
    2401
  • Lastpage
    2405
  • Abstract
    In this paper, in-depth experimental study was conducted on random walk approach for DC analysis of P/G network, and we also extended the random walk approach for RLC networks by Norton companion without any adjustment for the algorithm. Our experimental results suggest that the CPU times of solving several nodes by the algorithm is about one order of magnitude speedup over PCG, and the speedup may be higher if the circuits contain more VDD nodes. We also show how accuracy-runtime tradeoff of random walk algorithm could be made through adjusting the parameters of the algorithm. Our extended method works pretty well on both DC analysis and transient analysis comparing with direct method
  • Keywords
    network analysis; power grids; transient analysis; DC analysis; Norton companion; P-G network; RLC networks; power grid network analysis; random walks algorithm; transient analysis; Algorithm design and analysis; Analytical models; Circuit simulation; Computer science; Iterative methods; Power grids; Power system reliability; RLC circuits; Transient analysis; Voltage;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Circuits and Systems Proceedings, 2006 International Conference on
  • Conference_Location
    Guilin
  • Print_ISBN
    0-7803-9584-0
  • Electronic_ISBN
    0-7803-9585-9
  • Type

    conf

  • DOI
    10.1109/ICCCAS.2006.285161
  • Filename
    4064408