So we devise a buffer planning algorithm to allocate the buffer into tiles with congestion information considered. The buffer allocation problem is formulated ...

ABSTRACT. By dividing the packing area into routing tiles, we can give the budget of the buffer insertion. And the detail locating of the blocks in their ...

And the detail locating of the blocks in their rooms can be implemented for each iterations during the annealing process to favor the later buffer planning.

Dynamic global buffer planning optimization based on detail block locating and congestion analysis. Yuchun Ma, Xianlong Hong, Sheqin Dong, Song Chen, Yici ...

This paper dense a congestiondriven buffer insertion algorithm, in which single-pair shortest-path model is used to compute optimal buffer locations and ...

Dynamic global buffer planning optimization based on detail block locating and congestion analysis. Y Ma, X Hong, S Dong, S Chen, Y Cai, CK Cheng, J Gu.

This paper studies the problem of buffer planning for interconnect-centric floorplanning. We devise a congestion-driven buffer insertion algorithm, in which ...

This paper proposes approach to optimize the congestion and time closure by changing the distribution of the dead space in the placement, and devised a ...

Co-authors ; Dynamic global buffer planning optimization based on detail block locating and congestion analysis. Y Ma, X Hong, S Dong, S Chen, Y Cai, CK Cheng, J ...

Dynamic Global Buffer Planning Optimization Based on Detail Block Locating and Congestion Analysis, Prof. 40th Design Automation Conference(DAC2003), pp.806 ...