Routability-driven repeater block planning for interconnect-centric floorplanning

In this paper we present a repeater block planning algorithm for interconnect-centric floorplanning. We introduce the concept of independent feasible regions for repeaters and derive an analytical formula for their computation. We develop a routability-driven repeater clustering algorithm to perform repeater block planning based on iterative deletion. The goal is to obtain a high quality solution for the repeater block locations so that performance-driven interconnect synthesis at the routing stage can be carried out with ease, while minimizing the chip area. Experimental results show that our method increases the percentage of all global nets that meet their target delays from 67.5% in [8] to 85%. Meanwhile, our approach is able to minimize the expected routing congestion, making it easier for performance-driven routers to synthesize global nets that require the insertion of repeaters to meet timing constraints.

• Type: Conference
• Year: 2000
• Where: ISPD
• Authors: Probir Sarkar, Vivek Sundararaman, Cheng-Kok Koh
• Keywords: Block Planning Algorithm, Hardware, ISPD 2000, Repeater Block, Repeater Clustering Algorithm