Simultaneous floorplanning and buffer block planning

Abstract

Abstract-As technology advances and the number of interconnections among modules rapidly increases, timing closure and design convergence are the most important concerns. Hence, it is desirable to consider interconnect optimization as early as possible. In this paper, we first address simultaneous floorplanning and buffer block planning (i.e., integrating buffer block planning into floorplanning) for interconnect optimization. Experimental results show that our method can significantly improve the interconnect delay and reduce the number of buffers needed.

Buffer Planning for IP Placement Using Sliced-LFF

“…Deadspace means the interspace among the placed modules. Jiang et al [11] implemented floorplanning and buffer block planning simultaneously. In each iteration of SA, they constructed a routing tree for each net, allocated buffers, and introduced buffer blocks into the intermediate floorplan.…”

Integrating buffer planning with floorplanning for simultaneous multi-objective optimization

“…The UBF algorithm was implemented in the C++ language on a 450 MHz SUN Ultra 60 workstation and experimented on the six MCNC benchmark circuits used in [5,6,13,11]. See Table 2 for the statistics of the circuits.…”

“…The parameters for interconnects and buffers were based on the ¼ ½ Ñ technology given in the NTRS'97 roadmap [14] and were used in [5,6,11,13] (see Table 1 for the parameters). All parameters used are the same as [2,5,6,11].…”

“…All parameters used are the same as [2,5,6,11]. We adopted the rise time for an aggressor net as 0.25 ns, the power supply voltage as 1.8 V, and noise margin as 0.8 V. Same as [5,6,11], all nets were 2-pin connections and the power/ground nets were excluded. Also, we used the same delay constraints provided by the authors of [5,6], which were randomly generated in ½ ¼ ÌÓÔØ ½ ¾¼ÌÓÔØ .…”

“…We compared our results with the previous works BBP/FR [5,6] and FBP [11]. (We also list the results of IFR [13] for reader's reference.…”