No Access

EARLY BUFFER PLANNING WITH CONGESTION CONTROL USING BUFFER REQUIREMENT MAP

ALI JAHANIAN

Electrical and Computer Engineering Department, Shahid Beheshti University, G. C., Tehran, 19839-63113, Iran

Search for more papers by this author

and

MORTEZA SAHEB ZAMANI

IT and Computer Engineering Department, Amirkabir University of Technology, Tehran, 15875-4413, Iran

Search for more papers by this author

https://doi.org/10.1142/S0218126610006657Cited by:0 (Source: Crossref)

Abstract

Buffer insertion plays an important role in circuit performance and signal integrity especially in deep submicron technologies. The stage at which buffers are inserted in a design has a large impact on the design quality. Early buffer insertion may cause misestimation due to unknown cell locations whereas buffer insertion after placement may not be very effective because the cell locations have been fixed and buffer resources may be distributed inappropriately.

In this paper, a buffer planning algorithm for floor-placement design flow is presented. This algorithm creates a map of buffer requirements in various regions of the design at the floorplanning stage and then enforces the detailed placer to distribute white spaces with respect to the estimated buffer requirement map.

Experimental results show that the proposed method improves the performance of attempted circuits with fewer buffers. Furthermore, results show that congestion, routability and design convergence are improved and the auxiliary loops are avoided in the proposed design flow. Our analyses and experiments show that the CPU time overhead of this algorithm is very small.

This paper was recommended by Regional Editor Krishna Shenai.

Keywords:

References

J. Cong , SRC Design Sciences Concept Paper ( 1997 ) . Google Scholar
J. Cong, T. Kong and D. Z. Pan, Buffer block planning for interconnect driven floorplanning, Proc. IEEE/ACM Int. Conf. Computer-Aided Design (1999) pp. 54–57. Google Scholar
C. J. Alpertet al., IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 22, 189 (2003). Google Scholar
P. Sarkar, V. Sundararaman and C. K. Koh, Routability-driven repeater block planning for interconnect-centric floorplanning, Proc. Int. Symp. Physical Design (2000) pp. 186–191. Google Scholar
X. Tang and D. F. Wong, Planning buffer locations by network flow, Proc. Int. Symp. Physical Design (2000) pp. 180–185. Google Scholar
Y. Ma, X. Hong and S. Dong, IEEE Trans. Comput.-Aided Des. Integr. Circuits and Syst. 19, 609 (2000). Google Scholar
Y. Maet al., An integrated floorplanning with an efficient buffer planning algorithm, Proc. Int. Symp. Physical Design (2003) pp. 136–142. Google Scholar
Y. Maet al., Dynamic global buffer planning optimization based on detail block locating and congestion analysis, Proc. Design Automation Conf. (2003) pp. 806–811. Google Scholar
C. W. Sham, W. C. Wong and E. F. Y. Young, Congestion estimation with buffer planning in floorplan design, Proc. Design Automation and Test in Europe (2000) pp. 1–6. Google Scholar
S. Chenet al., A buffer planning algorithm with congestion optimization, Proc. Asia and South Pacific Design Automation Conf. (2004) pp. 615–620. Google Scholar
G. S. Garcea, N. P. Van der Mejis and R. H. J. M. Otten, Statistically aware buffer planning, Proc. Design Automation and Test in Europe (2004) pp. 1402–1403. Google Scholar
K. W. C. Wong and E. F. Y. Young, Fast buffer planning and congestion optimization in interconnect-driven floorplanning, Proc. Asia and South Pacific Design Automation Conf. (2003) pp. 411–416. Google Scholar
C. W. Sham and E. F. Y. Young, Routability driven floorplanner with buffer block planning, Proc. Int. Symp. Physical Design (2002) pp. 470–480. Google Scholar
Y. Maet al., Buffer planning algorithm based on partial clustered floorplanning, Proc. Int. Symp. Quality Electronic Design (2005) pp. 213–218. Google Scholar
F. F. Draganet al., Provably good global buffering using an available buffer block plan, Proc. IEEE/ACM Int. Conf. Computer-Aided Design (2000) pp. 104–109. Google Scholar
Y. H. Cheng and Y. W. Chang, Integrating buffer planning with floorplanning for simultaneous multi-objective optimization, Proc. Asia and South Pacific Design Automation Conf. (2004) pp. 624–627. Google Scholar
S. M. Li, Y. H. Cheng and Y. W. Chang, Noise-aware buffer planning for interconnect-driven floorplanning, Proc. Asia South Pacific Design Automation Conf. (2003) pp. 423–426. Google Scholar
Y. Maet al., Buffer allocation algorithm with consideration of routing congestion, Proc. and Asia South Pacific Design Automation Conf. (2004) pp. 621–623. Google Scholar
A. Jahanian and M. Saheb Zamani , Multi-level buffer block planning and buffer insertion for large design circuits , Proc. Int. Symp. Emerging VLSI Technologies and Architectures ( 2006 ) . Google Scholar
D. Hill and A. B. Kahng, IEEE Design & Test of Computers (2004) pp. 9–12. Google Scholar
J. A. Royet al., IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems (2005) pp. 1313–1326. Google Scholar
M. Saeedi, M. Saheb Zamani and A. Jahanian, Prediction and reduction of routing congestion, Proc. ACM Int. Symp. Physical Design (2006) pp. 72–77. Google Scholar
M. Saeedi, M. Saheb Zamani and A. Jahanian, Elsevier Microelectronics J. 38, 942 (2007). Crossref, Web of Science, Google Scholar
H. Chenet al., Refined single trunk tree: A rectilinear Steiner tree generator for interconnect prediction, Proc. System Level Interconnect Prediction (2002) pp. 85–89. Google Scholar
X. Yang, E. Bozorgzadeh and M. Sarrafzadeh, Wirelength estimation based on rent exponents of partitioning and placement, Proc. System Level Interconnect Prediction (2001) pp. 25–31. Google Scholar
D. Stroobandt, A priori system-level interconnect prediction: Rent's rule and wire length distribution models, Proc. System Level Interconnect Prediction (2001) pp. 3–21. Google Scholar
IWLS Benchmarks (2005), http://iwls.org/iwls2005/benchmarks.html. . Google Scholar
Magma Design Automation, A complete design solution for structured ASICs (2005), http://www.magma-da.com. . Google Scholar