The scaling challenge

Saxena, Prashant; Menezes, Noel; Cocchini, P.; Kirkpatrick, Desmond A.

doi:10.1145/640000.640014

Cited by 28 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As VLSI technology moves to the 65 2nm node and be-From practical point of view, slew buffering should be as yond, it has been well documented [1,2] that the number important as timing driven buffering. Unfortunately, there of buffers on a chip is rising dramatically.…”

Section: Introductionmentioning

confidence: 99%

Fast algorithms for slew constrained minimum cost buffering

Alpert¹,

Hu²,

Karandikar³

et al. 2006

2006 43rd ACM/IEEE Design Automation Conference

View full text Add to dashboard Cite

Abstract-As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast 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× speed up and save up to 20% buffer area over the commonlyused van Ginneken style buffering. The new algorithms also significantly outperform previous works that indirectly address the slew buffering problem.

show abstract

Section: Introductionmentioning

confidence: 99%

Fast algorithms for slew constrained minimum cost buffering

Alpert¹,

Hu²,

Karandikar³

et al. 2006

2006 43rd ACM/IEEE Design Automation Conference

View full text Add to dashboard Cite

show abstract

On the Use of Reinforcement Learning for Real-Time System Design and Refactoring

Haouari

Mzid

Mosbahi

2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Enhanced graph rewriting systems for complex software domains

et al. 2014

View full text Add to dashboard Cite

Methodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination.

show abstract

The scaling challenge

Cited by 28 publications

References 34 publications

Fast algorithms for slew constrained minimum cost buffering

Fast algorithms for slew constrained minimum cost buffering

On the Use of Reinforcement Learning for Real-Time System Design and Refactoring

Enhanced graph rewriting systems for complex software domains

Contact Info

Product

Resources

About