Advertisement

DPlace: Anchor Cell-Based Quadratic Placement with Linear Objective

  • Tao Luo
  • David Z. Pan
Part of the Series on Integrated Circuits and Systems book series (ICIR)

Although circuit placement has been studied for decades, it continuously attracts research attentions. The placement problems grow rapidly in both problem size and complexity. Some industry placement problems contain multimillion gates and excessive number of blockages [1,2]. In this chapter, we introduce DPlace, an anchor cell and diffusion spreading-based quadratic placement engine that can handle largescale placement problem.

Keywords

Hessian Matrix Nonzero Entry Wire Length Star Model Linear Objective 
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.

References

  1. 1.
    G.-J. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz, “The ispd2005 placement contest and benchmark suite,” in Proc. Int. Symp. on Physical Design, (New York, NY, USA), pp. 216-220, ACM, 2005CrossRefGoogle Scholar
  2. 2.
    G.-J. Nam, “Ispd 2006 placement contest: Benchmark suite and results,” in Proc. Int. Symp. on Physical Design, (New York, NY, USA), pp. 167-167, ACM, 2006Google Scholar
  3. 3.
    TimberWolf Systems, Inc., “Timberwolf placement & global routing software package,” in http://www2.twolf.com/benchmark.html
  4. 4.
    A.E. Caldwell, A.B. Kahng, and I.L.Markov, “Can recursive bisection alone produce routable, placements?,” in Proc. Design Automation Conf., pp. 477-482, 2000Google Scholar
  5. 5.
    M. Wang, X. Yang, and M. Sarrafzadeh, “Dragon2000: Standard-cell placement tool for large industry circuits,” in Proc. Int. Conf. on Computer Aided Design, pp. 260-263, 2000Google Scholar
  6. 6.
    M.C. Yildiz and P.H. Madden, “Improved cut sequences for partitioning based placement,” in Proc. Design Automation Conf., (New York, NY, USA), pp. 776-779, ACM, 2001Google Scholar
  7. 7.
    J. Kleinhans, G. Sigl, F.M. Johannes, and K. Antreich, “GORDIAN: VLSI placement by quadratic programming and slicing optimization,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. CAD-10, pp. 356-365, March 1991Google Scholar
  8. 8.
    H. Eisenmann and F. M. Johannes, “Generic global placement and floorplanning,” in Proc. Design Automation Conf., pp. 269-274, 1998Google Scholar
  9. 9.
    B. Hu and M. Marek-Sadowska, “Far: fixed-points addition & relaxation based placement,” in Proc. Int. Symp. on Physical Design, (New York, NY, USA), pp. 161-166, ACM, 2002Google Scholar
  10. 10.
    A.B. Kahng and Q. Wang, “An analytic placer for mixed-size placement and timingdriven placement,” in Proc. Int. Conf. on Computer Aided Design, pp. 565-572, November 2004Google Scholar
  11. 11.
    N. Viswanathan and C.C.N. Chu, “Fastplace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model,” in Proc. Int. Symp. on Physical Design, pp. 26-33, 2004Google Scholar
  12. 12.
    K. Vorwerk, A. Kennings, and A. Vannelli, “Engineering details of a stable force-directed placer,” in Proc. Int. Conf. on Computer Aided Design, 2004Google Scholar
  13. 13.
    T. Chan, J. Cong, and K. Sze, “Multilevel generalized force-directed method for circuit placement,” in Proc. Int. Symp. on Physical Design, 2005Google Scholar
  14. 14.
    B. Yao, H. Chen, C.-K. Cheng, N.-C. Chou, L.-T. Liu, and P. Suaris, “Unified quadratic programming approach for mixed mode placement,” in Proc. Int. Symp. on Physical Design, 2005Google Scholar
  15. 15.
  16. 16.
    A.B. Kahng, S. Reda, and Q. Wang, “Aplace: A general analytic placement framework,” in Proc. Int. Symp. on Physical Design, pp. 233-235, April 2005Google Scholar
  17. 17.
    T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang, “A high quality analytical placer considering preplaced blocks and density constraint,” in Proc. Int. Conf. on Computer Aided Design, 2006Google Scholar
  18. 18.
    W.C. Naylor, R. Donelly, and L. Sha”, “Non-linear optimization system and method for wire length and dealy optimization for an automatic electric circuit placer,” US patent 6,301,693,2001Google Scholar
  19. 19.
    T. Luo and D.Z. Pan, “Large scale placement with explicit cell movement control,” in Technical Report UT-CERC-06-01, April 2006Google Scholar
  20. 20.
    F. Mo, A. Tabbara, and R. K. Brayton, “A force-directed macro-cell placer,” in Proc. Int. Conf. on Computer Aided Design, p. 4, EECS, UC Berkeley, November 2000 A demo can be found at: http://www-cad.eecs.berkeley.edu/fanmo/PlacementAlgorithm/index.html
  21. 21.
  22. 22.
    P. Spindler and F. M. Johannes, “Fast and robust quadratic placement combined with an exact linear net model,” in Proc. Int. Conf. on Computer Aided Design, 2006Google Scholar
  23. 23.
    H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia, “Diffusion-based placement migration,” in Proc. Design Automation Conf., June, 2005Google Scholar
  24. 24.
    G. Sigl, K. Doll, and F. M. Johannes, “Analytical placement: A linear or a quadratic objective function?,” in DAC ’91: Proc. 28th Conf. on ACM/IEEE Design Automation, (New York, NY, USA), pp. 427-432, ACM, 1991CrossRefGoogle Scholar
  25. 25.
    D. Hill, “Method and system for high speed detailed placement of cells within an integrated circuit design,” US patent 6,370,673, 2002Google Scholar
  26. 26.
    M. Pan, N. Viswanathan, and C.C.N. Chu, “An efficient and effective. detailed placement algorithm,” in Proc. Int. Conf. on Computer Aided Design, 2005Google Scholar
  27. 27.
  28. 28.
    H. Qian and S.S. Sapatnekar, “A hybrid linear equation solver and its application in quadratic placement,” in Proc. Int. Conf. on Computer Aided Design, 2005Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Tao Luo
  • David Z. Pan

There are no affiliations available

Personalised recommendations