A new fast slew buffering algorithm without input slew assumptions

Abstract

As VLSI technology moves to the nanoscale regime, an ultra-fast slew buffering technique to buffer large number of nets and minimize buffering cost is highly desirable. The existing method proposed in [1] is able to efficiently perform buffer insertion with a simplified assumption on buffer input slew, however, when handling more general cases without input slew assumptions, it becomes slow despite that significant amount of buffer area savings can be obtained. In this paper, a fast buffering technique is proposed to handle this difficult general problem. Instead of building solutions from scratch, the new approach performs efficient optimizations to buffering solutions obtained with the fixed input slew assumption. Experiments on industrial netlists demonstrate that our algorithm is very effective and highly efficient. Compared to the commonly-used van Ginneken style buffering, up to 49 × speed up Is obtained and often 10% buffer area is saved. Compared to the algorithm without input slew assumption proposed in [1], up to 37× speedup can be obtained with slight sacrifice in solution quality. ©2007 IEEE.