Article

Free access

Prime: a timing-driven placement tool using a piecewise linear resistive network approach

Authors:

Takeo Hamada,

Chung-Kuan Cheng,

Paul M. ChauAuthors Info & Claims

DAC '93: Proceedings of the 30th international Design Automation Conference

Pages 531 - 536

https://doi.org/10.1145/157485.165015

Published: 01 July 1993 Publication History

PDF eReader

References

[1]

H. B. Bakoglu, Circuits,/~*ercon~ec~io~s, and Packaging /or VLSI, Reading, MA: Addison-Wesley, 1990.

Google Scholar

[2]

D. P. Bertsekas, Constrained Optimization and Lagrange M~ltiplier Metl~od6, S~u Diego, CA: Academic Press, 1982.

Google Scholar

[3]

D. L. Carter and D. F. Guise, "Analysis of Signal Propagation Delays and Chip Level Performance Due to On- Chip Interconnections," Proc. of Int. Conf. on Computer Design, pp. 218-221, Nov. 1983.

Google Scholar

[4]

C. A. Desoer and E. S. Kuh, Basic Circuit Theow, New York, NY: McGraw-Hill, 1969.

Google Scholar

[5]

A. E. Dunlop, V. D. Agrawal et al., "Chip Layout Optimization Using Critical Path Weighting," Proc. of $Ist Design A~tomation Conf., pp. 133-136, 1984.

Digital Library

Google Scholar

[6]

T. FLfiis&wa and B. S. Kuh, "Piecewise-linear Theory of Nonlinear Networks," SIAM J. Appl. Mark., vol. 22, no. 2, pp.307-328, Mar. 1972.

Digital Library

Google Scholar

[7]

T. Gao, P. M. Vaidya, ~md O. L. Liu, "A Performance Driven Macro-Cell Placement Algorithm," Proc. of 29th Design Automation Conf., pp.147-152, June 1992.

Digital Library

Google Scholar

[8]

O. Hadley, Nonlinear and D~namic Programming, Reading, MA: Addison-Wesley, 1964.

Google Scholar

[9]

F,.-H, Homeber and W. M~this, "A Closed-Form Expression for Signal Delay in CMOS-Drlven Branc.~ed Transmission Lines" in VLSI'87, ed. by C. H. Sequin, pp. 353- 362.

Google Scholar

[10]

M. A. B. Jackson and E. S. Kuh, "Performance-Driven Placement of Cell Based IC's," Proc. of 26th Design Automation Conf., pp.370-375, June 1989.

Digital Library

Google Scholar

[11]

J. Katzenelson, "An algorithm for solving nonlinear resistive networks," Bell System Tech. J., vol. 44, pp.1605- 1620, 1965.

Crossref

Google Scholar

[12]

I. Lin, D. H. C. Du, "Performance-Driven Constructive Placement," Proc. of 2?th Design Automation Conf., pp.103-106, June 1990.

Digital Library

Google Scholar

[13]

Y. Ogawa, et al., "Efficient Placement Algorithms Optimizing Delay for High-Speed EGL Masterslice LSI's," Proc. o} t3rd Design Automation Conf., pp. 404-410, June 1986.

Digital Library

Google Scholar

[14]

S. Praaitjutrakul and W. J. Kubitz, "A Timing-Driven Global Router for Custom Chip Design," Proc. of Int. Conf. on Computer-Aided Design, pp.48-51, Nov. 1990.

Google Scholar

[15]

T. Sakurai, "Approximation of Wiring Delay in MOSFET LSI," IEEE Journal o} Solid-State Circuits, vol. SC-18, no. 4, pp. 418-426, 1983.

Crossref

Google Scholar

[16]

G. Sigl, K. Doll, F. M. Johannes, "Analytical Placement: A Linear or a Quadratic Objective Function?," Proc. of ~.8th Design Automation Conj., pp. 427-432, June 1991.

Digital Library

Google Scholar

[17]

A. Srinivasan, K. Chaudhary, E. S. Kuh, "RITUAL: A Performance Driven Placement Algorithm for Small Cell IOs", Proc. of Int. Con{. on Computer-Aided Design, pp. 48-51, Nov. 1991.

Google Scholar

[18]

S. Sutanthavibul and E. Shragowitz, "An Adaptive Timing-Drlven Layout for High Speed VLSI," Proe. o} ~Tth Design Automation Con~., pp. 90-95, June. 1990.

Digital Library

Google Scholar

[19]

S. Teig, R. L. Smith and J. Seaton, "Timing-Driven Layout of Cell-Based ICs," VLSI S~stems Design, pp. 63-73, May 1986.

Google Scholar

[20]

R. S. Tsay and E. S. Kuh, "Module Placement for Large Chips Based on Sparse Linear Equations," Int. Jou~al of Circuit Theor~ and Applications, vol. 16, pp. 411-423, 1988.

Crossref

Google Scholar

[21]

N. Weste, K. Esh~,e, hian, P~n~ivles of CMOS VLSl Design: A S~stems Perspective, Reading MA: Addison- Wesley, 1985.

Digital Library

Google Scholar

[22]

P. Woffe, "A Duality Theorem for Nonlinear Programruing," Quarterl3t of Applied Math., vol. 19, 239, 1961.

Crossref

Google Scholar

Cited By

View all

Liao PGuo DGuo ZLiu SLin YYu B(2023)DREAMPlace 4.0: Timing-Driven Placement With Momentum-Based Net Weighting and Lagrangian-Based RefinementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.324013242:10(3374-3387)Online publication date: Oct-2023
https://doi.org/10.1109/TCAD.2023.3240132
Liao PLiu SChen ZLv WLin YYu BBolchini CO'Connor IVerbauwhede IWille R(2022)DREAMPlace 4.0Proceedings of the 2022 Conference & Exhibition on Design, Automation & Test in Europe10.5555/3539845.3540064(939-944)Online publication date: 14-Mar-2022
https://dl.acm.org/doi/10.5555/3539845.3540064
Liao PLiu SChen ZLv WLin YYu B(2022)DREAMPlace 4.0: Timing-driven Global Placement with Momentum-based Net Weighting2022 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE54114.2022.9774725(939-944)Online publication date: 14-Mar-2022
https://doi.org/10.23919/DATE54114.2022.9774725
Show More Cited By

Index Terms

Prime: a timing-driven placement tool using a piecewise linear resistive network approach

Recommendations

One-regular graphs of square-free order of prime valency

A graph is one-regular if its automorphism group acts regularly on the set of arcs of the graph. Marusic and Pisanski [D. Marusic and T. Pisanski, Symmetries of hexagonal graphs on the torus, Croat. Chemica Acta 73 (2000) 969-981] classified one-regular ...
Weak metacirculants of odd prime power order

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This paper is ...
On vertex-transitive graphs of odd prime-power order

Marusic (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of order p^k are Cayley graphs for each prime p and k = 1,2, or 3, and constructed a non-Cayley vertex-transitive graph of order p^k and valency 2p + 2 for each prime p ≥ ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DAC '93: Proceedings of the 30th international Design Automation Conference

July 1993

768 pages

ISBN:0897915771

DOI:10.1145/157485

Chairman:
Alfred E. Dunlop
AT&T Bell Labs., Murray Hill, NJ

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC93

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC93: The 30th ACM/IEEE Design Automation Conference

June 14 - 18, 1993

Texas, Dallas, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
391
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)20

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liao PGuo DGuo ZLiu SLin YYu B(2023)DREAMPlace 4.0: Timing-Driven Placement With Momentum-Based Net Weighting and Lagrangian-Based RefinementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.324013242:10(3374-3387)Online publication date: Oct-2023
https://doi.org/10.1109/TCAD.2023.3240132
Liao PLiu SChen ZLv WLin YYu BBolchini CO'Connor IVerbauwhede IWille R(2022)DREAMPlace 4.0Proceedings of the 2022 Conference & Exhibition on Design, Automation & Test in Europe10.5555/3539845.3540064(939-944)Online publication date: 14-Mar-2022
https://dl.acm.org/doi/10.5555/3539845.3540064
Liao PLiu SChen ZLv WLin YYu B(2022)DREAMPlace 4.0: Timing-driven Global Placement with Momentum-based Net Weighting2022 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE54114.2022.9774725(939-944)Online publication date: 14-Mar-2022
https://doi.org/10.23919/DATE54114.2022.9774725
Guo ZLin YOshana R(2022)Differentiable-timing-driven global placementProceedings of the 59th ACM/IEEE Design Automation Conference10.1145/3489517.3530486(1315-1320)Online publication date: 10-Jul-2022
https://dl.acm.org/doi/10.1145/3489517.3530486
Wu GChu C(2017)Two Approaches for Timing-Driven Placement by Lagrangian RelaxationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.269794736:12(2093-2105)Online publication date: Dec-2017
https://doi.org/10.1109/TCAD.2017.2697947
Livramento VNetto RGuth CGüntzel JSantos L(2016)Clock-Tree-Aware Incremental Timing-Driven PlacementACM Transactions on Design Automation of Electronic Systems10.1145/285879321:3(1-27)Online publication date: 19-Apr-2016
https://dl.acm.org/doi/10.1145/2858793
Guth CLivramento VNetto RFonseca RGüntzel JSantos LDavoodi AYoung E(2015)Timing-Driven Placement Based on Dynamic Net-Weighting for Efficient Slack Histogram CompressionProceedings of the 2015 Symposium on International Symposium on Physical Design10.1145/2717764.2717766(141-148)Online publication date: 29-Mar-2015
https://dl.acm.org/doi/10.1145/2717764.2717766
Markov IHu JKim M(2015)Progress and Challenges in VLSI Placement ResearchProceedings of the IEEE10.1109/JPROC.2015.2478963103:11(1985-2003)Online publication date: Nov-2015
https://doi.org/10.1109/JPROC.2015.2478963
Markov IHu JKim MHu A(2012)Progress and challenges in VLSI placement researchProceedings of the International Conference on Computer-Aided Design10.1145/2429384.2429441(275-282)Online publication date: 5-Nov-2012
https://dl.acm.org/doi/10.1145/2429384.2429441
Babu BSwetha RDevi K(2011)Comparision of Hierarchial Mixed-Size Placement Algorithms for VLSI Physical Synthesis2011 International Conference on Communication Systems and Network Technologies10.1109/CSNT.2011.95(430-435)Online publication date: Jun-2011
https://doi.org/10.1109/CSNT.2011.95
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

One-regular graphs of square-free order of prime valency

Weak metacirculants of odd prime power order

On vertex-transitive graphs of odd prime-power order