• DocumentCode
    1650399
  • Title

    Fast Wire Length Estimation by Net Bundling for Block Placement

  • Author

    Yan, Tan ; Murata, Hiroshi

  • Author_Institution
    Fac. of Environ. Eng., Kitakyushu Univ.
  • fYear
    2006
  • Firstpage
    172
  • Lastpage
    178
  • Abstract
    The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea is to bundle the 2-pin nets between block pairs, and measure the wire length bundle by bundle, instead of net by net. Previous bundling method (Chan et al., 2005) introduces a huge error which compromises the performance. We present an error-free bundling approach which utilizes the piecewise linear wire length function of a pair of blocks. With the function implemented into a lookup table, the wire length can be computed promptly and precisely by binary search. Furthermore, we show that 3-pin nets can also be bundled, resulting in a further speedup. The effectiveness of our method is verified by experiments
  • Keywords
    logic CAD; table lookup; 2-pin nets; binary search; block placement; error-free bundling; fast wire length estimation; lookup table; net bundling; piecewise linear wire length function; Application specific integrated circuits; Computer applications; Design automation; Integrated circuit interconnections; Length measurement; Permission; Piecewise linear techniques; Runtime; Table lookup; Wire; Lookup table; Net bundling; Wire length estimation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer-Aided Design, 2006. ICCAD '06. IEEE/ACM International Conference on
  • Conference_Location
    San Jose, CA
  • ISSN
    1092-3152
  • Print_ISBN
    1-59593-389-1
  • Electronic_ISBN
    1092-3152
  • Type

    conf

  • DOI
    10.1109/ICCAD.2006.320082
  • Filename
    4110170