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

Details An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types

2007-10-25

arxiv.org/abs/0710.4691v1

Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)

Computer Science

Hardware Architecture

Submitted on behalf of EDAA (http://www.edaa.com/)

Scientific paper

Buffer insertion is a popular technique to reduce the interconnect delay. The classic buffer insertion algorithm of van Ginneken has time complexity O(n^2), 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^2 n^2). For modern design libraries that contain hundreds of buffers, it 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 (bn^2) 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.

Affiliated with

Also associated with

No associations

Rating

An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431815