Article

Free access

On minimal closure constraint generation for symbolic cell assembly

Authors:

Debaprosad Dutt,

Chi-Yuan LoAuthors Info & Claims

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

Pages 736 - 739

https://doi.org/10.1145/127601.127761

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

Ackland, B. and Weste, N. "An Automatic Assembly Tool for VirtualGrid Symbolic Layout," VLSI '83, Trondheim Norway, August 1983, pp. 457-466.

Google Scholar

[2]

A.V. Aho, J. Hopcroft and J.D Ullman, The Design and Analysis of Computer Algorithms, Addison- Wesley, MA. 1974.

Digital Library

Google Scholar

[3]

J.L. Bums and R.A. Newton, "SPARCS: A New Constraint-Based IC Symbolic Layout Spacer," Proceedings of IEEE Custom Integrated Circuits Conference, pp. 534-539, 1986.

Google Scholar

[4]

T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, McGraw-Hill, 1990.

Digital Library

Google Scholar

[5]

Jurgen Doenhardt and Thomas Lengauer, "Algorithmic Aspects of One-Dimensional Layout Compaction," IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems, CAD-6(5), pp. 863-878, September 1987.

Digital Library

Google Scholar

[6]

J. Edmond and R.M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. Assoc. Comput. Mach., 19:248-264, 1972.

Digital Library

Google Scholar

[7]

Peter A. Eichenberger, Fast Symbolic Layout Translation for Custom VLSI Integrated Circuits, Technical Report No. 86-295, Stanford University, April, 1986.

Google Scholar

[8]

Donald B. Johnson, "Efficient Algorithms for Shortest Paths in Sparse Networks," J. Assoc. Comput. Mach. 24 (1):1-13, 1977.

Digital Library

Google Scholar

[9]

Eugene Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976, pp. 160-165.

Google Scholar

[10]

C-Y. Lo and Ravi Varadarajan, "An O(nl"51ogn) 1D Compaction Algorithm," Proc. 27th Design Automation Conference, pp. 382-386, June 1990.

Digital Library

Google Scholar

[11]

David Marple, "A Hierarchy Preserving Hierarchical Compactor," Proc. 2 7th Design Automation Conference, pp. 275-381, June 1990.

Digital Library

Google Scholar

[12]

R. Okuda, T. Sato, H. Onodera and K. Tamam, "An Efficient Algorithm for Layout Compaction Problem with Symmetry Constraints," Digest o t International Conference on Computer -Aided Design, pp. 148-153, November 1989.

Google Scholar

[13]

Mark Reichelt and Wayne Wolf, "An Improved Cell Model for Hierarchical Constraint-Graph Compaction," Digest of International Conference on Computer-Aided Design, pp. 482-485, November 1986.

Google Scholar

[14]

Mark Reichelt, "An Improved Cell Model for Hierarchical Layout Compaction," Master's Thesis, Mrr, 1987.

Google Scholar

[15]

R.E. Tarjan, Data Structures and Network Algorithms, Society of Industrial and Applied Mathematics, Philadelphia, Pa., 1983, pp. 94-95.

Digital Library

Google Scholar

Cited By

View all

Yao SCheng CDutt DNahar SLo C(2006)A cell-based hierarchical pitchmatching compaction using minimal LPIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37237914:4(523-526)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.372379
Pan PDong SLiu CDunlop A(1993)Optimal graph constraint reduction for symbolic layout compactionProceedings of the 30th international Design Automation Conference10.1145/157485.164950(401-406)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164950
Yao SCheng CDutt DNahar SLo CDunlop A(1993)Cell-based hierarchical pitchmatching compaction using minimal LPProceedings of the 30th international Design Automation Conference10.1145/157485.164947(395-400)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164947
Show More Cited By

Index Terms

On minimal closure constraint generation for symbolic cell assembly

Recommendations

Minimal threshold closure
ESORICS'06: Proceedings of the 11th European conference on Research in Computer Security

Access structure is a flexible mechanism for representing complex access control and authorization policies [1]. Numerous efforts have been devoted to the research of efficient schemes for implementing access structures in a scalable manner. Threshold ...
Constraint management in mechanical assembly modeling
Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect ...

Comments

Information & Contributors

Information

Published In

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

June 1991

783 pages

ISBN:0897913957

DOI:10.1145/127601

Chairman:
A. Richard Newton
Univ. of California, Berkeley

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 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC91

Sponsor:

SIGDA
IEEE-CS

DAC91: The 28th ACM/IEEE Design Automation Conference

June 17 - 22, 1991

California, San Francisco, 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

6
Total Citations
View Citations
193
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)12

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yao SCheng CDutt DNahar SLo C(2006)A cell-based hierarchical pitchmatching compaction using minimal LPIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37237914:4(523-526)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.372379
Pan PDong SLiu CDunlop A(1993)Optimal graph constraint reduction for symbolic layout compactionProceedings of the 30th international Design Automation Conference10.1145/157485.164950(401-406)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164950
Yao SCheng CDutt DNahar SLo CDunlop A(1993)Cell-based hierarchical pitchmatching compaction using minimal LPProceedings of the 30th international Design Automation Conference10.1145/157485.164947(395-400)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164947
Bamji CVaradarajan RDunlop A(1993)MSTCProceedings of the 30th international Design Automation Conference10.1145/157485.164944(389-394)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164944
Bamji CVaradarajan RSchweikert D(1992)Hierarchical pitchmatching compaction using minimum designProceedings of the 29th ACM/IEEE Design Automation Conference10.5555/113938.149468(311-317)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.5555/113938.149468
Bamji CVaradarajan R(1992)Hierarchical pitchmatching compaction using minimum design[1992] Proceedings 29th ACM/IEEE Design Automation Conference10.1109/DAC.1992.227787(311-317)Online publication date: 1992
https://doi.org/10.1109/DAC.1992.227787

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

Minimal threshold closure

Constraint management in mechanical assembly modeling

Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Minimal threshold closure

Constraint management in mechanical assembly modeling

Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations