Making fast buffer insertion even faster via approximation techniques Conference Paper uri icon

abstract

  • As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing electrical violations. Consequently, buffer insertion is needed on tens of thousands of nets during physical synthesis optimization. Even the fast implementation of van Ginneken's algorithm requires several hours to perform this task. This work seeks to speed up the van Ginneken style algorithms by an order of magnitude while achieving similar results. To this end, we present three approximation techniques in order to speed up the algorithm: (1) aggressive pre-buffer slack pruning, (2) squeeze pruning, and (3) library lookup. Experimental results from industrial designs show that using these techniques together yields solutions in 9 to 25 times faster than van Ginneken style algorithms, while only sacrificing less than 3% delay penalty. 2005 IEEE.

published proceedings

  • ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2

author list (cited authors)

  • Li, Z., Sze, C. N., Alpert, C. J., Hu, J., Shi, W., & IEEE.

complete list of authors

  • Li, Zhuo||Sze, CN||Alpert, Charles J||Hu, Jiang||Shi, Weiping

publication date

  • December 2005