ACM Home Page
Please provide us with feedback. Feedback
Optimal non-uniform wire-sizing under the Elmore delay model
Full text Publisher SitePublisher Site PdfPdf (262 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 38 - 43  
Year of Publication: 1997
ISBN:0-8186-7597-7
Authors
Chung-Ping Chen  Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Hai Zhou  Department of Computer Sciences, University of Texas at Austin, Austin, Texas
D. F. Wong  Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 25,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: (1) total weighted sink-delays; (2) total area subject to sink-delay bounds; and (3) maximum sink delay. We first present an algorithm NWSA-wd for minimizing total weighted sink-delays based on iteratively applying the wire-sizing formula. We show that NWSA-wd always converges to an optimal wire-sizing solution. Based on NWSA-wd and the Lagrangian relaxation technique, we obtained two algorithms NWSA-db and NWSA-md which can optimally solve the other two minimization objectives. Experimental results show that our algorithms are efficient both in terms of runtime and storage. For example, NWSA-wd, with linear runtime and storage, can solve a 6201-wire segment routing-tree problem using about 1.5-second runtime and 1.3-MB memory on an IBM RS/6000 workstation.


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.-P. Chen, D. F. Wong. "A fast algorithm for optireal wire-sizing under Elmore delay model" Proc. IEEE ISCAS, vol. 4, pp. 412-415, 1996.
 
3
J. Cong and K. Leung, "Optimal wiresizing under Elmore delay model," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 14(3), pp. 321-336, 1995.
 
4
W. C. Elmore, "The transient response of damped linear networks with particular regard to wide band amplifiers", J. Applied Physics, 19(1), 1948.
 
5
 
6
 
7
R.-S. Tsay, "Exact zero skew," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systerns, Feb. 1993.
 
8
M. L. Fisher, "An applications oriented guide to Lagrangian relaxation," Interfaces, 15:2, pp. 10-21, March-April 1985.
 
9
J. P. Fishburn and C. A. Schevon, "Shaping a distributed-RC line to minimize Elmore delay", IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, Vol. 42, No. 12, pp. 1020- 1022, December 1995.
 
10
D. G. Luenberger, Linear and Nonlinear Programming, Addison-Wesley Pub. Company Inc., 1984.
11
 
12

CITED BY  12
 
 
 
 
 
 
 

Collaborative Colleagues:
Chung-Ping Chen: colleagues
Hai Zhou: colleagues
D. F. Wong: colleagues

Peer to Peer - Readers of this Article have also read: