File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast algorithms for slew-constrained minimum cost buffering

TitleFast algorithms for slew-constrained minimum cost buffering
Authors
KeywordsBuffer insertion
Input slew
Interconnect
NP-complete
Slew constraint
Issue Date2007
Citation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007, v. 26, n. 11, p. 2009-2022 How to Cite?
AbstractAs a prevalent constraint, sharp slew rate is often required in circuit design, which causes a huge demand for buffering resources. This problem requires ultrafast buffering techniques to handle large volume of nets while also minimizing buffering cost. This problem is intensively studied in this paper. First, a highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations. Second, a new algorithm using the maximum matching technique is developed to handle the difficult cases in which no assumption is made on buffer input slew. Third, an adaptive buffer selection approach is proposed to efficiently handle slew buffering with continuous buffer locations. Fourth, buffer blockage avoidance is handled, which makes the algorithms ready for practical use. Experiments on industrial netlists demonstrate that our algorithms are very effective and highly efficient: we achieve about 90 × speedup and save up to 20% buffer area over the commonly used van Ginneken style buffering. The new algorithms also significantly outperform previous works that indirectly address the slew buffering problem. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/336036
ISSN
2023 Impact Factor: 2.7
2023 SCImago Journal Rankings: 0.957
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHu, Shiyan-
dc.contributor.authorAlpert, Charles J.-
dc.contributor.authorHu, Jiang-
dc.contributor.authorKarandikar, Shrirang K.-
dc.contributor.authorLi, Zhuo-
dc.contributor.authorShi, Weiping-
dc.contributor.authorSze, C. N.-
dc.date.accessioned2024-01-15T08:22:13Z-
dc.date.available2024-01-15T08:22:13Z-
dc.date.issued2007-
dc.identifier.citationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007, v. 26, n. 11, p. 2009-2022-
dc.identifier.issn0278-0070-
dc.identifier.urihttp://hdl.handle.net/10722/336036-
dc.description.abstractAs a prevalent constraint, sharp slew rate is often required in circuit design, which causes a huge demand for buffering resources. This problem requires ultrafast buffering techniques to handle large volume of nets while also minimizing buffering cost. This problem is intensively studied in this paper. First, a highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations. Second, a new algorithm using the maximum matching technique is developed to handle the difficult cases in which no assumption is made on buffer input slew. Third, an adaptive buffer selection approach is proposed to efficiently handle slew buffering with continuous buffer locations. Fourth, buffer blockage avoidance is handled, which makes the algorithms ready for practical use. Experiments on industrial netlists demonstrate that our algorithms are very effective and highly efficient: we achieve about 90 × speedup and save up to 20% buffer area over the commonly used van Ginneken style buffering. The new algorithms also significantly outperform previous works that indirectly address the slew buffering problem. © 2007 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems-
dc.subjectBuffer insertion-
dc.subjectInput slew-
dc.subjectInterconnect-
dc.subjectNP-complete-
dc.subjectSlew constraint-
dc.titleFast algorithms for slew-constrained minimum cost buffering-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TCAD.2007.906477-
dc.identifier.scopuseid_2-s2.0-43349103479-
dc.identifier.volume26-
dc.identifier.issue11-
dc.identifier.spage2009-
dc.identifier.epage2022-
dc.identifier.isiWOS:000250415500009-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats