An algorithm for integrated pin assignment and buffer planning
Pages 561 - 572
Abstract
The buffer block methodology has become increasingly popular as more and more buffers are needed in deep-submicron design, and it leads to many challenging problems in physical design. In this article, we present a polynomial-time exact algorithm for integrated pin assignment and buffer planning for all two-pin nets from one macro block (source block) to all other blocks of a given buffer block plan, while minimizing the total cost α ˙ W + β ˙ R for any positive α and β where W is the total wirelength, and R is the number of buffers. By applying this algorithm iteratively (each time, pick one block as the source block), it provides a polynomial-time algorithm for pin assignment and buffer planning for nets among multiple macro blocks. Experimental results demonstrate its efficiency and effectiveness.
References
[1]
Ahuja, R. K., Goldberg, A. V., Orlin, J. B., and Tarjan, R. E. 1992. Finding minimum-cost flows by double scaling. Mathemati. Program. 53, 243--266.
[2]
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. 1993. Network Flows. Prentice Hall. Upper Saddle River, NJ.
[3]
Bakoglu, H. B. 1990. Circuits, Interconnections, and Packaging for VLSI. Addison-Wesley.
[4]
Cong, J. 1997. Challenges and opportunities for design innovations in nanometer technologies. SRC Working Papers. Available at http://www.src.org/prg_mgmt/frontier.dgw.
[5]
Cong, J., Kong, T., and Pan, D. Z. 1999. Buffer block planning for interconnect driven floorplanning. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 358--363.
[6]
Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1992. Introduction to Algorithms. The MIT Press, Cambridge, MA.
[7]
Dragan, F. F., Kahng, A. B., Mandoiu, I. I., Muddu, S., and Zelikovsky, A. 2000. Provably good global buffering using an available buffer block plan. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'00). 104--109.
[8]
Dragan, F. F., Kahng, A. B., Mandoiu, I. I., Muddu, S., and Zelikovsky, A. 2001. Provably good global buffering by multiterminal multicommodity flow approximation. In Proceedings of the Asian and South Pacific Design Automation Conference (DAC). Yokohama, Japan. 120--125.
[9]
Otten, R. 1998. Global wires harmful. In Proceedings of the International Symposium on Physical Design (ISPD'98). 104---109.
[10]
Preas, B. and Lorenzetti, M. 1988. Physical Design Automation of VLSI Systems. Benjamin/Cummings, Menlo Park, CA.
[11]
Sarkar, P., Sundararaman, V., and Koh, C. K. 2000. Routability-driven repeater block planning for interconnect-centric floorplanning. In Proceedings of the International Symposium on Physical Design (ISPD'00).
[12]
Tang, X. and Wong, D. F. 2000. Planning buffer locations by network flows. In Proceedings of the International Symposium on Physical Design (ISPD'00). 180--185.
Index Terms
- An algorithm for integrated pin assignment and buffer planning
Recommendations
An algorithm for integrated pin assignment and buffer planning
DAC '02: Proceedings of the 39th annual Design Automation ConferenceThe buffer block methodology has become increasingly popular as more and more buffers are needed in deep-submicron design, and it leads to many challenging problems in physical design. In this paper, we present a polynomial-time exact algorithm for ...
Signal through-the-silicon via planning and pin assignment for thermal and wire length optimization in 3D ICs
Signal through-the-silicon via (STS-via) planning plays an important role in multi-layer nets which need vertical interconnection between different device layers. Moreover, STS-via can also dissipate heat, which is a much more serious problem in 3D ICs ...
Ordered escape routing via routability-driven pin assignment
GLSVLSI '10: Proceedings of the 20th symposium on Great lakes symposium on VLSIFor board-level routing, ordered escape routing is a key problem. In this paper, based on the optimality of hierarchical bubble sorting, the process of assigning routability-driven pins is done for single-layer routing. Furthermore, an efficient routing ...
Comments
Information & Contributors
Information
Published In
Copyright © 2005 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Published: 01 July 2005
Published in TODAES Volume 10, Issue 3
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 362Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in