Article

Free access

Cell-based hierarchical pitchmatching compaction using minimal LP

Authors:

Chi-Yuan LoAuthors Info & Claims

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

Pages 395 - 400

https://doi.org/10.1145/157485.164947

Published: 01 July 1993 Publication History

PDF eReader

References

[1]

C.S. Bamji and R. Varadarajan, "Hierarchical pitchmatching compaction using minimum design," ACM/IEEE 29th Design Automation Conference, pp. 311 - 317, 1992.

Digital Library

Google Scholar

[2]

C. Bamji, C. Hauck, and J. Allen,"A design-byexample regular structure generator," A CM/IEEE 22nd Design Automation Conference, pp. 16- 22, 1985.

Digital Library

Google Scholar

[3]

D. Boyer, "Symbolic compaction benchmarks," Proceeding International Conference on Computer Design, pp. 186- 191; 209- 217, 1987.

Google Scholar

[4]

D. Dutt and C. Y. Lo,"On minimal closure constraint generation for symbolic cell assembly," A CM/IEEE 28th Design Automation Conference, pp., 1991.

Digital Library

Google Scholar

[5]

W. Kim, J. Lee, H. Shin,"A new hierarchical layout compactor using simplified graph models," A CM/IEEE 29th Design Automation Conference, pp. 323 - 326, 1992.

Digital Library

Google Scholar

[6]

J.F. Lee and D. T. Tang,"HIMALAYAS- a hierarchical compaction system with a minimized constraint Set," To appear in IEEE International Conference on CAD, 1992.

Digital Library

Google Scholar

[7]

C.Y. Lo and R. Varadarajan, "An O(nl'51og n) 1-d compaction algorithm," A CM/IEEE 27th Design Automation Conference, pp. 382- 387, 1990.

Digital Library

Google Scholar

[8]

D. Marple,"A hierarchy preserving hierarchical compactor," ACM/IEEE 27th Design Automation Conference, pp. 134- 140, 1990.

Digital Library

Google Scholar

Cited By

View all

Shaphir EPinter RWimer S(2014)Cell-based interconnect migration by hierarchical optimizationIntegration, the VLSI Journal10.1016/j.vlsi.2013.10.00347:2(161-174)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1016/j.vlsi.2013.10.003
Moiseev KKolodny AWimer SMoiseev KKolodny AWimer S(2014)Layout MigrationMulti-Net Optimization of VLSI Interconnect10.1007/978-1-4614-0821-5_9(195-219)Online publication date: 16-Oct-2014
https://doi.org/10.1007/978-1-4614-0821-5_9
Fu DChaung YLin YLi Y(2009)Topology-driven cell layout migration with collinear constraints2009 IEEE International Conference on Computer Design10.1109/ICCD.2009.5413118(439-444)Online publication date: Oct-2009
https://doi.org/10.1109/ICCD.2009.5413118
Show More Cited By

Index Terms

Cell-based hierarchical pitchmatching compaction using minimal LP

Recommendations

A cell-based hierarchical pitchmatching compaction using minimal LP

We describe a new linear programming (LP)-based hierarchical pitchmatching method. With a simplified treatment of the intercell constraints, the size of the LP problems is significantly reduced as compared to the best known results. In particular, the ...
Simultaneous Two-Dimensional Cell Layout Compaction Using MILP with ASTRAN
ISVLSI '14: Proceedings of the 2014 IEEE Computer Society Annual Symposium on VLSI

This paper describes a technique to compact cell layouts efficiently using Mixed-Integer Linear Programming. By using binary variables we were able not only to model the conditional design rules, which apply to technology nodes down to 65nm, but also to ...
Hypergraphic LP relaxations for steiner trees
IPCO'10: Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Könemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the integrality gap of ...

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 299 of 1,119 submissions, 27%

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

7
Total Citations
View Citations
177
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)2

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shaphir EPinter RWimer S(2014)Cell-based interconnect migration by hierarchical optimizationIntegration, the VLSI Journal10.1016/j.vlsi.2013.10.00347:2(161-174)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1016/j.vlsi.2013.10.003
Moiseev KKolodny AWimer SMoiseev KKolodny AWimer S(2014)Layout MigrationMulti-Net Optimization of VLSI Interconnect10.1007/978-1-4614-0821-5_9(195-219)Online publication date: 16-Oct-2014
https://doi.org/10.1007/978-1-4614-0821-5_9
Fu DChaung YLin YLi Y(2009)Topology-driven cell layout migration with collinear constraints2009 IEEE International Conference on Computer Design10.1109/ICCD.2009.5413118(439-444)Online publication date: Oct-2009
https://doi.org/10.1109/ICCD.2009.5413118
Wang LLai Y(2006)Graph-theory-based simplex algorithm for VLSI layout spacing problems with multiple variable constraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.93637820:8(967-979)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.936378
Apanovich ZMarchuk A(1998)Top-down approach to technology migration for full-custom mask layoutsProceedings Eleventh International Conference on VLSI Design10.1109/ICVD.1998.646577(48-52)Online publication date: 1998
https://doi.org/10.1109/ICVD.1998.646577
Apanovich ZMarchuk A(1997)DECOMP: a technology migration subsystem for full chip mask layouts1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-199710.1109/PACRIM.1997.620415(942-945)Online publication date: 1997
https://doi.org/10.1109/PACRIM.1997.620415
DORNEICH MSAHINIDIS N(1995)GLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTIONEngineering Optimization10.1080/0305215950894125925:2(131-154)Online publication date: Oct-1995
https://doi.org/10.1080/03052159508941259

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

A cell-based hierarchical pitchmatching compaction using minimal LP

Simultaneous Two-Dimensional Cell Layout Compaction Using MILP with ASTRAN

Hypergraphic LP relaxations for steiner trees