An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types Conference Paper uri icon

abstract

  • Buffer insertion is apopular technique to reduce the interconnect delay. The classic buffer insertion algorithm of van Ginneken has time complexity O(n2), where n is the number of buffer positions. Lillis, Cheng and Lin extended van Ginneken's algorithm to allow b buffer types in time O(b 2n2). For modern design libraries that contain hundreds of buffers, il is a serious challenge to balance the speed and performance of the buffer insertion algorithm. In this paper; we present a new algorithm that computes the optimal buffer insertion in O(bn2) time. The reduction is achieved by the observation that the (Q, C)pairs of the candidates that generate the new candidates must form a convex hull. On industrial test cases, the new algorithm is faster than the previous best buffer insertion algorithms by orders of magnitude.

name of conference

  • Design, Automation and Test in Europe

published proceedings

  • Design, Automation and Test in Europe

author list (cited authors)

  • Zhuo Li, .., & Weiping Shi.

citation count

  • 6

publication date

  • January 2005

publisher