ACM Home Page
Please provide us with feedback. Feedback
Hierarchical analysis of power distribution networks
Full text PdfPdf (207 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 150 - 155  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Min Zhao  Advanced Tools, Motorola Inc., Austin, TX
Rajendran V. Panda  Advanced Tools, Motorola Inc., Austin, TX
Sachin S. Sapatnekar  Dept. of ECE, University of Minnesota, Minneapolis, MN
Tim Edwards  Advanced Tools, Motorola Inc., Austin, TX
Rajat Chaudhry  Advanced Tools, Motorola Inc., Austin, TX
David Blaauw  Advanced Tools, Motorola Inc., Austin, TX
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 25,   Citation Count: 31
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/337292.337355
What is a DOI?

ABSTRACT

Careful design and verification of the power distribution network of a chip are of critical importance to ensure its reliable performance. With the increasing number of transistors on a chip, the size of the power network has grown so large as to make the verification task very challenging. The available computational power and memory resources impose limitations on the size of networks that can be analyzed using currently known techniques. Many of today's designs have power networks that are too large to be analyzed in the traditional way as flat networks. In this paper, we propose a hierarchical analysis technique to overcome the aforesaid capacity limitation. We present a new technique for analyzing a power grid using macromodels that are created for a set of partitions of the grid. Efficient numerical techniques for the computation and sparsification of the port admittance matrices of the macromodels are presented. A novel sparsification technique using a 0-1 integer linear programming formulation is proposed to achieve superior sparsification for a specified error. The run-time and memory efficiency of the proposed method are illustrated through the analysis of case studies of several multi-million node power grids, extracted from real microprocessor and DSP designs.


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
2
3
 
4
S. Taylor, "The challenge of designing global signals in UDSM CMOS," in CICC, pp. 429-435, 1999.
 
5
H. Kriplani, F. Najm, and I. Hajj, "Pattern independent minimum current estimation in power and ground buses of CMOS VLS! circuits," TCAD, vol. 14, no. 8, pp. 998-1012, 1995.
6
7
 
8
G. H. Golub and C. F. V. Loan, Matrix Computations. Baltimore: The Johns Hopkins University Press, 1984.
 
9
C. Ho, A. Ruehli, and R Brennan, "The modified nodal approach to network analysis," IEEE Trans. Circuits and Systems, vol. CAS-22, no. 6, pp. 504-509, 1975.
 
10
 
11
 
12
M. R. C. M. Berkelaar, "LP SOLVE 2.3 Users' Manual," 1998.

CITED BY  31

Collaborative Colleagues:
Min Zhao: colleagues
Rajendran V. Panda: colleagues
Sachin S. Sapatnekar: colleagues
Tim Edwards: colleagues
Rajat Chaudhry: colleagues
David Blaauw: colleagues