Power Grid Analysis using Random Walks

This paper presents a linear-time algorithm for the DC analysis of a power grid, based on a random walk technique. Experimental results show that the proposed method is faster than existing approaches and has an acceptable error margin. It also has a desirable property of localizing computation, and can be extended to RC-network
transient analysis. This method has been applied to circuits of up to 70K nodes, for which the solution time for a single node was 0.42 sec and the complete solution was obtained in 17.6 sec.

By: Haifeng Qian, Sani R. Nassif, Sachin Sapatnekar

Published in: RC22722 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .