ACM Home Page
Please provide us with feedback. Feedback
Random walks in a supply network
Full text PdfPdf (268 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Power grid analysis and optimization table of contents
Pages: 93 - 98  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Haifeng Qian  University of Minnesota, Minneapolis, MN
Sani R. Nassif  IBM Austin Research Labs, Austin, TX
Sachin S. Sapatnekar  University of Minnesota, Minneapolis, MN
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 31,   Citation Count: 33
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775832.775860
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. G. Doyle and J. L. Snell, "Random walks and electric networks", 1984. http://front.math.ucdavis.edu/math.PR/0001057
 
2
 
3
C. Ho, A. E. Ruehli, and P. Brennan, "The modified nodal approach to network analysis," IEEE Transactions on Circuits and Systems, vol. CAS-22, no. 6, pp.504--509, 1975.
 
4
J. Kozhaya, S. R. Nassif, and F. N. Najm, "A multigrid-like technique for power grid analysis," IEEE Transactions on Computer-Aided Design, vol. 21, no. 10, pp.1148--1160, 2002.
 
5
 
6
Y. L. Le Coz and R. B. Iverson, "A stochastic algorithm for high speed capacitance extraction in integrated circuits," Solid-State Electronics, vol.35, no. 7, pp. 1005--1012, 1992.
 
7
SPEC CPU2000 Results, available at http://www.specbench.org/cpu2000/results/cpu2000.html
 
8
R. D. Yates and D. J. Goodman, Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers, John Wiley and Sons, New York, 1999.
 
9
 
10
M. Zhao, R. V. Panda, S. S. Sapatnekar, and D. Blaauw, "Hierarchical analysis of power distribution networks," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 2, pp. 159--168, Feb. 2002.

CITED BY  33

Collaborative Colleagues:
Haifeng Qian: colleagues
Sani R. Nassif: colleagues
Sachin S. Sapatnekar: colleagues