• DocumentCode
    2455316
  • Title

    Fractional cut: improved recursive bisection placement

  • Author

    Agnihotri, Ameya ; Yildiz, M.C. ; Khatkhate, Ateen ; Mathur, Ajita ; Ono, S. ; Madden, Patrick H.

  • Author_Institution
    Dept. of Comput. Sci., SUNY Binghamton, NY, USA
  • fYear
    2003
  • fDate
    9-13 Nov. 2003
  • Firstpage
    307
  • Lastpage
    310
  • Abstract
    In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoids a "narrow region" problem. To support these new cut line positions, a dynamic programming based legalization algorithm has been developed. The combination of these has improved the stability and lowered the wire lengths produced by our Feng Shui placement tool. On benchmarks derived from industry partitioning examples, our results are close to those of the annealing based tool Dragon, while taking only a fraction of the run time. On synthetic benchmarks, our wire lengths are nearly 23% better than those of Dragon. For both benchmark suites, our results are substantially better than those of the recursive bisection based tool Capo and the analytic placement tool Kraftwerk.
  • Keywords
    circuit layout CAD; dynamic programming; simulated annealing; software tools; Capo; Dragon; Feng Shui placement tool; Kraftwerk; analytic placement tool; annealing based tool; bisection based tool; dynamic programming; horizontal cut lines; legalization algorithm; recursive bisection placement; wire lengths; Annealing; Computer science; Equations; Explosions; Fabrication; Logic gates; Partitioning algorithms; Permission; Stability; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Aided Design, 2003. ICCAD-2003. International Conference on
  • Conference_Location
    San Jose, CA, USA
  • Print_ISBN
    1-58113-762-1
  • Type

    conf

  • DOI
    10.1109/ICCAD.2003.1257685
  • Filename
    1257685