Analysis of very large resistive networks using low distortion embedding

VLSI designs contain very large resistive networks consisting of hundreds of millions (10e11) of resistors. Accurate parasitic extraction and analysis of such large networks is essential in many phases of the VLSI design flow. Existing techniques to analyze large resistive networks using linear solvers, despite recent optimizations, still take prohibitive computation time. In this paper a new technique based on low-distortion embedding to estimate point-to-point effective resistance is presented. Our proposed method employs recently discovered techniques from theoretical computer science to compute an ε-approximate resistance embedding matrix from which effective resistances of all node pairs can be estimated as easily as taking the Euclidean norm of column differences. The proposed method runs in almost linear time (linear in the number of resistors), and the accuracy (ε) is user specified. The method has been implemented and experimental results on large networks containing upto 10e11 nodes are presented. Compared to existing method using sparse linear solvers, our methods are more than 10 times faster on mesh networks and more importantly given a network of n nodes, allow computation of effective resistance between arbitrary node pairs in O(lg(n)) time (lg denotes logarithm to base 2).

[1]  Eby G. Friedman,et al.  Fast algorithms for IR voltage drop analysis exploiting locality , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[2]  Eby G. Friedman,et al.  Effective Resistance of a Two Layer Mesh , 2011, IEEE Transactions on Circuits and Systems II: Express Briefs.

[3]  Nikhil Srivastava,et al.  Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..

[4]  Joost Rommes,et al.  Efficient Methods for Large Resistor Networks , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  G. Venezian,et al.  On the resistance between two points on a grid , 1994 .

[6]  Martin D. F. Wong,et al.  Fast algorithms for IR drop analysis in large power grid , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[7]  Sani R. Nassif,et al.  Power grid analysis using random walks , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

[9]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[10]  Eby G. Friedman,et al.  Fast algorithms for power grid analysis based on effective resistance , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[11]  Shiyan Hu,et al.  Power grid analysis with hierarchical support graphs , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[12]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.