Chip Planning

  • Andrew B. Kahng
  • Jens Lienig
  • Igor L. Markov
  • Jin Hu
Chapter

Abstract

Chip planning deals with large modules such as caches, embedded memories, and intellectual property (IP) cores that have known areas, fixed or changeable shapes, and possibly fixed locations. When modules are not clearly specified, chip planning relies on netlist partitioning (Chap. 2) to identify such modules in large designs. Assigning shapes and locations to circuit modules during chip planning produces blocks, and enables early estimates of interconnect length, circuit delay and chip performance. Such early analysis can identify modules that need improvement. Chip planning consists of three major stages (1) floorplanning, (2) pin assignment, and (3) power planning.

Keywords

Shape Function Corner Point Hamiltonian Path Sequence Pair Constraint Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Chapter 3 References

  1. [3.1]
    C. J. Alpert, D. P. Mehta and S. S. Sapatnekar, eds., Handbook of Algorithms for Physical Design Automation, CRC Press, 2009.Google Scholar
  2. [3.2]
    H. N. Brady, “An Approach to Topological Pin Assignment”, IEEE Trans. on CAD 3(3) (1984), pp. 250–255.MathSciNetGoogle Scholar
  3. [3.3]
    T.-C. Chen and Y.-W. Chang, “Modern Floorplanning Based on B*-Tree and Fast Simulated Annealing”, IEEE Trans. on CAD 25(4) (2006), pp. 637–650.Google Scholar
  4. [3.4]
    S. Kang, “Linear Ordering and Application to Placement”, Proc. Design Autom. Conf., 1983, pp. 457–464.Google Scholar
  5. [3.5]
    S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, “Optimization by Simulated Annealing”, Science 220(4598) (1983), pp. 671–680.CrossRefMathSciNetGoogle Scholar
  6. [3.6]
    N. L. Koren, “Pin Assignment in Automated Printed Circuit Board Design”, Proc. Design Autom. Workshop, 1972, pp. 72–79.Google Scholar
  7. [3.7]
    M. D. Moffitt, J. A. Roy, I. L. Markov and M. E. Pollack, “Constraint-Driven Floorplan Repair”, ACM Trans. on Design Autom. of Electronic Sys. 13(4) (2008), pp. 1–13.CrossRefGoogle Scholar
  8. [3.8]
    R. H. J. M. Otten, “Efficient Floorplan Optimization”, Proc. Intl. Conf. on Computer Design, 1983, pp. 499–502.Google Scholar
  9. [3.9]
    R. H. J. M. Otten and L. P. P. P. van Ginneken, “Floorplan Design Using Simulated Annealing”, Proc. Intl. Conf. on CAD, 1984, pp. 96–98.Google Scholar
  10. [3.10]
    C. Sechen, “Chip Planning, Placement and Global Routing of Macro/Custom Cell Integrated Circuits Using Simulated Annealing”, Proc. Design Autom. Conf., 1988, pp. 73–80.Google Scholar
  11. [3.11]
    L. Stockmeyer, “Optimal Orientation of Cells in Slicing Floorplan Designs”, Information and Control 57 (1983), pp. 91–101.MATHCrossRefMathSciNetGoogle Scholar
  12. [3.12]
    S. Sutanthavibul, E. Shragowitz and J. B. Rosen, “An Analytical Approach to Floorplan Design and Optimization”, IEEE Trans. on CAD 10 (1991), pp. 761–769.Google Scholar
  13. [3.13]
    X. Tang, R. Tian and D. F. Wong, “Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation”, Proc. Design, Autom. and Test in Europe, 2000, pp. 106–111.Google Scholar
  14. [3.14]
    D. F. Wong and C. L. Liu, “A New Algorithm for Floorplan Design”, Proc. Design Autom. Conf., 1986, pp. 101–107.Google Scholar
  15. [3.15]
    J. Xiong, Y.-C. Wong, E. Sarto and L. He, “Constraint Driven I/O Planning and Placement for Chip-Package Co-Design”, Proc. Asia and South Pacific Design Autom. Conf., 2006, pp. 207–212.Google Scholar
  16. [3.16]
    J. Z. Yan and C. Chu, “DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanner”, Proc. Design Autom. Conf., 2008, pp. 161–166.Google Scholar
  17. [3.17]
    T. Yan and H. Murata, “Fast Wire Length Estimation by Net Bundling for Block Placement”, Proc. Intl. Conf. on CAD, 2006, pp. 172–178.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Andrew B. Kahng
    • 1
  • Jens Lienig
    • 2
  • Igor L. Markov
    • 3
  • Jin Hu
    • 3
  1. 1.Departments of CSE and ECEUniversity of California at San DiegoLa JollaUSA
  2. 2.Electrical Engineering and Information TechnologyDresden University of TechnologyDresdenGermany
  3. 3.Electrical Engineering and Computer ScienceUniversity of MichiganAnn ArborUSA

Personalised recommendations