Article

Free access

Minimum padding to satisfy short path constraints

Authors:

Narendra V. Shenoy,

Robert K. Brayton,

Alberto L. Sangiovanni-VincentelliAuthors Info & Claims

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

Pages 156 - 161

Published: 07 November 1993 Publication History

PDF eReader

References

[1]

M.R.C.M. Berkelaar and J. A. G. Jess. Private communication. June, 1993.

Google Scholar

[2]

C.L. Berman, J. L. Carter, and K. E Day. The Fanout Problem: From Theory to Practice. In Advanced Research in VLSI: Proceedings of the 1989 Decennial Caltech Conference, pages 69-99, 1989.

Digital Library

Google Scholar

[3]

J. E Fishbum. A Depth-Decreasing Heuristic for Combinational Logic. In Proceedings of the Design Automation Conference, pages 361-364,1990.

Digital Library

Google Scholar

[4]

J. P. Fishbum. LA'ITIS: An Iterative Speedup Heuristic for Mapped Logic. In Proceedings of the Design Automation Conference, pages 488-491,1992.

Digital Library

Google Scholar

[5]

M.R. Garey and D. S. Johnson. Computers and Intractability A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.

Digital Library

Google Scholar

[6]

P.G. Paulin and F. Poirot. Logic Decompostion Algorithms for the Timing Optimization of Multi-Level Logic. In Proceedings of the International Conference on Computer Destgn, pages 329-33, 1989.

Google Scholar

[7]

N. Shenoy, R. K. Brayton, and A. Sangi~vanni-VincenteUi" Resynthesis of Multi-Phase Pipelines. In Proceedings of the Design Automation Conference, 1993.

Digital Library

Google Scholar

[8]

N. V. Shenoy. Timing Issues in Sequential Circuits. PhD thesis, University of California, Berkeley, 1993.

Google Scholar

[9]

K.J. Singh, A. R. Wang, R. K. Brayton, andA. Sangiovanni- V'mcentelli. Timing Optimization of Combinational Logic. In Proceedings of the International Conference on Computer-Aided Design, pages 282-285, 1988.

Crossref

Google Scholar

[10]

H. Touati. Performance-Oriented Technology Mapping. PhD thesis, University of California, Berkeley, 1990.

Digital Library

Google Scholar

[11]

D. Wong, G. De Mieheli, and M. Flynn. Inserting Active Delay Elements to Achieve Wave Pipelining. In Proceedings of the International Conference on Computer-Aided Design, pages 270-273. IEEE, 1989.

Crossref

Google Scholar

Cited By

View all

Li XShahsavani SZhou XPedram MBeerel P(2021)A Variation-aware Hold Time Fixing Methodology for Single Flux Quantum Logic CircuitsACM Transactions on Design Automation of Electronic Systems10.1145/346028926:6(1-17)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1145/3460289
Chiu WJiang ILu CChang Y(2017)Power and Area Efficient Hold Time Fixing by Free Metal Segment AllocationProceedings of the 54th Annual Design Automation Conference 201710.1145/3061639.3062303(1-6)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3061639.3062303
Huang SYeh HNieh Y(2015)Clock Period Minimization with Minimum Leakage PowerACM Transactions on Design Automation of Electronic Systems10.1145/277895421:1(1-33)Online publication date: 2-Dec-2015
https://dl.acm.org/doi/10.1145/2778954
Show More Cited By

Recommendations

Cost-based Filtering for Shorter Path Constraints
Abstract
Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest Path Problems with additional constraints. A well studied problem in this ...
Automating the construction of patchers that satisfy global constraints
IJCAI'89: Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Generate-and-test algorithms to solve constraint satisfaction problems are often inefficient, but can be constructed fairly easily by knowledge compilation techniques that convert declarative problem knowledge and domain knowledge into a procedural ...
SaDe: Learning Models that Provably Satisfy Domain Constraints
Machine Learning and Knowledge Discovery in Databases
Abstract
In many real world applications of machine learning, models have to meet certain domain-based requirements that can be expressed as constraints (for example, safety-critical constraints in autonomous driving systems). Such constraints are often ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

November 1993

781 pages

ISBN:0818644907

Chairmen:
Michael Lightner
Univ. of Colorado, Boulder
,
Jochen A. G. Jess
Eindhoven Univ. of Tech., Eindhoven, The Netherlands

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 07 November 1993

Check for updates

Qualifiers

Article

Conference

ICCAD '93

Sponsor:

SIGDA
IEEE-CS

ICCAD '93: International Conference on Computer Aided Design

November 7 - 11, 1993

California, Santa Clara, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
328
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)8

Reflects downloads up to 24 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li XShahsavani SZhou XPedram MBeerel P(2021)A Variation-aware Hold Time Fixing Methodology for Single Flux Quantum Logic CircuitsACM Transactions on Design Automation of Electronic Systems10.1145/346028926:6(1-17)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1145/3460289
Chiu WJiang ILu CChang Y(2017)Power and Area Efficient Hold Time Fixing by Free Metal Segment AllocationProceedings of the 54th Annual Design Automation Conference 201710.1145/3061639.3062303(1-6)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3061639.3062303
Huang SYeh HNieh Y(2015)Clock Period Minimization with Minimum Leakage PowerACM Transactions on Design Automation of Electronic Systems10.1145/277895421:1(1-33)Online publication date: 2-Dec-2015
https://dl.acm.org/doi/10.1145/2778954
Yeh HHuang SNieh YFettweis GNebel W(2014)Leakage-power-aware clock period minimizationProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2616991(1-6)Online publication date: 24-Mar-2014
https://dl.acm.org/doi/10.5555/2616606.2616991
Wu PWong MNedelchev IBhardwaj SParkhe V(2014)On Timing ClosureProceedings of the 51st Annual Design Automation Conference10.1145/2593069.2593171(1-6)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1145/2593069.2593171
Tu WChou CHuang SChang SNieh YChou CHenkel J(2013)Low-power timing closure methodology for ultra-low voltage designsProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561964(697-704)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561964
Yang YJiang IHo SKoh CSze C(2013)PushPullProceedings of the 2013 ACM International symposium on Physical Design10.1145/2451916.2451928(50-57)Online publication date: 24-Mar-2013
https://dl.acm.org/doi/10.1145/2451916.2451928
Li BChen NSchlichtmann UPhillips JHu AGraeb H(2011)Fast statistical timing analysis for circuits with post-silicon tunable clock buffersProceedings of the International Conference on Computer-Aided Design10.5555/2132325.2132354(111-117)Online publication date: 7-Nov-2011
https://dl.acm.org/doi/10.5555/2132325.2132354
Liu YYuan FXu QStok LDutt NHassoun S(2011)Re-synthesis for cost-efficient circuit-level timing speculationProceedings of the 48th Design Automation Conference10.1145/2024724.2024760(158-163)Online publication date: 5-Jun-2011
https://dl.acm.org/doi/10.1145/2024724.2024760
Brusamarello LNeuberger GWirth GSilva RReis RMurgai RReddy SWalker W(2010)Statistical analysis of hold time violationsJournal of Computational Electronics10.1007/s10825-010-0322-y9:3-4(114-121)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1007/s10825-010-0322-y
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

Recommendations

Cost-based Filtering for Shorter Path Constraints

Automating the construction of patchers that satisfy global constraints

SaDe: Learning Models that Provably Satisfy Domain Constraints