Recent work on wirelength optimization suggests that hierarchical  or multi-level [27, 161] approach is indispensable to efficiently solve large-scale placement problem. Correspondingly, timing-driven placement problem using hierarchical or multi-level framework should draw research attention. Several recent works address this problem. Ou et al.  adopt a net-cut control method in min-cut placement. Halpin et al.  presented a linear programming based net length control for recursive bisection placement. Kahng et al.  extended the placement flow in  to incorporate direct minimization of the critical path. The above approaches shows the trend of the combination between traditional timing-driven approach and top-down placement flow. However, delay budgeting, as a previously effective approach, has not been applied into the top-down placement framework.
KeywordsDelay Bound Placement Flow Delay Budget Design Hierarchy Delay Violation
Unable to display preview. Download preview PDF.
- 1.Here we assume that the internal delay from different input pins to the output pin are the same. We will interchangeably use slack of node and slack of net in this paper.Google Scholar
- 2.It is also associated to the net which node vz drives, under the assumption that each node has one output and the net delay is calculated using the bounding box of the net.Google Scholar
- 3.The delay of a net is proportional to the half-perimeter of the bounding box of the net.Google Scholar
- 4.The node which drives that net will be assigned the weight.Google Scholar