Random walks in a supply network

This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transient analysis. The method has the desirable property of localizing computation, so that it shows massive benefits over conventional methods when only a small part of the grid is to be analyzed (for example, when the effects of small changes to the grid are to be examined). Even for the full analysis of the grid, experimental results show that the method is faster than existing approaches and has an acceptable error margin. This method has been applied to test circuits of up to 2.3M nodes. For example, for a circuit with 70K nodes, the solution time for a single node was 0.42 sec and the complete solution was obtained in 17.6 sec.

[1]  Rajendran Panda,et al.  Hierarchical analysis of power distribution networks , 2000, DAC.

[2]  Robert K. Brayton,et al.  Probabilistic state space search , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[3]  Sani R. Nassif,et al.  Multigrid-like technique for power grid analysis , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[4]  Jovan Zagajac.  A fast method for estimating discrete field values in early engineering design , 1995, SMA '95.

[5]  R. B. Iverson,et al.  A stochastic algorithm for high speed capacitance extraction in integrated circuits , 1992 .

[6]  Andrew B. Kahng,et al.  A new approach to effective circuit clustering , 1992, ICCAD.

[7]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[8]  Albert E. Ruehli,et al.  The modified nodal approach to network analysis , 1975 .