ACM Home Page
Please provide us with feedback. Feedback
Congestion-driven codesign of power and signal networks
Full text PdfPdf (201 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: New perspectives in physical design table of contents
Pages: 64 - 69  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Haihua Su  IBM Corp., Austin, TX, and Univ. of Minnesota, Minneapolis, MN
Jiang Hu  IBM Corp., Austin, TX, and Univ. of Minnesota, Minneapolis, MN
Sachin S. Sapatnekar  IBM Corp., Austin, TX, and ECE Dept, Univ. of Minnesota, Minneapolis, MN
Sani R. Nassif  IBM Corp., Austin, TX, and Univ. of Minnesota, Minneapolis, MN
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Citation Count: 9
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/513918.513936
What is a DOI?

ABSTRACT

We present a global wire design methodology that simultaneously considers the performance needs for both signal lines and power grids under congestion considerations. An iterative procedure is employed in which the global routing is performed according to a congestion map that includes the resource utilization of the power grid, followed by a step in which the power grid is adjusted to relax the congestion in crowded regions. This adjustment is in the form of wire removal in noncritical regions, followed by a wire sizing step that overcomes the effects of wire removal. Experimental results show that the overall routability can be significantly improved while the power grid noise is maintained within the voltage droop constraint.


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
C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, and D. Karger. Prim Dijkstra Tradeoffs for Improved Performance-Drrive Routing Tree Design. IEEE Transactions on Computer-Aided Design of ICs and Systems, 14(7):890--896, July 1995.
 
3
P. T. Boggs and J. W. Tolle. Sequential Quadratic Programming. Cambridge Univ. Press, Cambridge, 1995.
4
 
5
H. H. Chen and J. S. Neely. Interconnect and Circuit Modeling Techniques for Full-Chip Power Supply Noise Analysis. IEEE Transactions on Components, Packaging, and Manufacturing Technology, Part B, 21(3):209--215, August 1998.
 
6
C. Chiang and M. Sarrafzadeh. Global Routing Based on Steiner Min-max Tree. IEEE Transactions on Computer-Aided Design, 9(12):1318--1325, December 1990.
7
 
8
S. W. Director and R. A. Rohrer. The Generalized Adjoint Network and Network Sensitivities. IEEE Transactions on Circuit Theory, 16(3):318--323, August 1969.
 
9
P. Feldmann, T. V. Nguyen, S. W. Director, and R. A. Rohrer. Sensitivity Computation in Piecewise Approximation Circuit Simulation. IEEE Transactions on Computer-Aided Design of ICs and Systems, 10(2):171--183, February 1991.
 
10
P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. User's Guide for SOL/QPSOL: A Fortran Package for Quadratic Programming. Department of Operations Research, Stanford University, July, 1983.
 
11
12
 
13
R. Nair. A Simple Yet Effective Technique for Global Wiring. IEEE Transactions on Computer-Aided Design, 6(2):165--172, March 1987.
14
 
15
L. T. Pillage, R. A. Rohrer, and C. Visweswariah. Electronic and System Simulation Methods. McGraw-Hill, New York, NY, 1995.
 
16
 
17
18
19
 
20
B. S. Ting and B. N. Tien. Routing and Techniques for Gate Array. IEEE Transactions on Computer-Aided Design, 2(4):301--312, October 1983.
 
21
22

CITED BY  9

Collaborative Colleagues:
Haihua Su: colleagues
Jiang Hu: colleagues
Sachin S. Sapatnekar: colleagues
Sani R. Nassif: colleagues