Academic
Publications
A robust detailed placement for mixed-size IC designs

A robust detailed placement for mixed-size IC designs,10.1145/1118299.1118353,Jason Cong,Min Xie

A robust detailed placement for mixed-size IC designs   (Citations: 26)
BibTex | RIS | RefWorks Download
Abstract, The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in re-cent years. Although several algorithms have been proposed for mixed-sized placements, most of them primarily focus on the global placement aspect. In this paper we propose a three-step approach, named XDP, for mixed-size detailed placement. First, a combination of constraint graph and linear programming is used to legalize macros. Then, an enhanced greedy method is used to legalize the standard cells. Finally, a sliding-window-based cell swapping is applied to further reduce wirelength. The impact of individual techniques is analyzed and quantified. Experiments show that when applied to the set of global placement results gen-erated by APlace [1], XDP can produce wirelength comparable to the native detailed placement of APlace, and 3% shorter wire-length compared to Fengshui 5.0 [2]. When applied to the set of global placements generated by mPL6 [3], XDP is the only de-tailed placement that successfully produces legal placement for all the examples, while APlace and Fengshui fail for and of the examples. For cases where legal placements can be compared, the wirelength produced by XDP is shorter by 3% on average compared to APlace and Fengshui. Furthermore, XDP displays a higher robustness than the other tools by covering a broader spectrum of examples by different global placement tools.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Fastplace[ll] legalizes the cells with dynamic programming, then Global Swap, Vertic � Sw�p, Local Re­ ordering, and Single-Segment Clustenng Improve the solution; Aplace, Fengshui, mPL[12] by Hill's patent[10], then use a window sp�ning � �ingle row or multiple rows and slide it across the ChIP; a mmlmum cost flow based legalization algorithm was proposed by Brenner[13]...

    Fuzhen Chenet al. A reliable detail placement tool for mixed mode IC design

    • ...Macros are legalized with an approach similar to that published in [33] and [34]...

    Peter Spindleret al. Kraftwerk2 - A Fast Force-Directed Quadratic Placement Approach Using ...

    • ...The consistency of the improvement in the global placement phase is checked by using another detailed placer XDP [6]...

    Jason Conget al. Highly efficient gradient computation for density-constrained analytic...

    • ...The original version of this paper was published in 2006 [21]...
    • ...The follow-up work of Cong and Xie [21], named Floorist, appears in [2]...
    • ...The conclusions and future work are presented in Section V. A preliminary version of this paper was presented in [21]...

    Jason Conget al. A Robust Mixed-Size Legalization and Detailed Placement Algorithm

    • ...The leading macro legalizers, XDP [12] and Floorist [16], can also be applied to determine the legalized macro positions...
    • ...This procedure, at first glance, is similar to the one proposed in [12] (XDP), but we extend it to consider pre-placed macros and add significant modifications to handle the addressed problem...
    • ...Lemma 1: A TCG is feasible if and only if κ =0 . Unlike [12] that resorts to an iterative graph refinement process, we model the infeasibility into our cost function to guide the adaptive SA process...
    • ...At first glance, the main differences between our linearprogramming formulation and that of [12] lie in Inequalities (2) and (3)...
    • ...As a matter of fact, our formulation/process has the following advantages over the work [12]: • Instead of optimizing macro displacement alone, we introduce the concept of reference position expansion to expand the displacement reference position linearly w.r.t...
    • ...• It will be clear in Section IV-A that our linear programming formulation achieves 6% shorter HPWL on average than that of [12] with comparable running time...
    • ...We also compared our macro placer with the leading macro placer, MPtree [9], [10], and the macro legalizer, XDP [12]...

    Hsin-chen Chenet al. Constraint graph-based macro placement for modern mixed-size circuit d...

Sort by: