An $O(bn^{2})$ Time Algorithm for Optimal Buffer Insertion with $b$ Buffer Types**This research was supported by the NSF grants CCR-0098329, CCR-0113668, ElA-0223785, ATP grant 512-0266-2001. 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.

author list (cited authors)

  • Li, Z., & Shi, W.

citation count

  • 6

publication date

  • January 2005

publisher