Loading...
Please wait, while we are loading the content...
Similar Documents
Computational geometry based placement migration (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Luo, Tao Ren, Haoxing Alpert, Charles J. Pan, David Z. |
| Description | Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To fix a design problem, one would like to perturb the design as little as possible while preserving the integrity of the original placement. This work presents a novel computational geometry based placement migration method, and a new stability metric to more accurately measure the “similarity” between two placements. It has two stages, a bin-based spreading at coarse scale and a Delaunay triangulation based spreading at finer grain. It has clear advantage over conventional legalization algorithms such that the neighborhood characteristics of the original placement are preserved. Thus, the placement migration is much more stable, which is important to maintain. Applying this technique to placement legalization demonstrates significant improvements in wire length and stability compared to other popular legalization algorithms. 1. in Proc. Int. Conf. on Computer Aided Design |
| File Format | |
| Language | English |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | New Stability Wire Length Original Placement Bin-based Spreading Signal Integrity Delaunay Triangulation Design Problem Popular Legalization Algorithm Computational Geometry Significant Improvement Neighborhood Characteristic Placement Migration Method Coarse Scale Finer Grain Conventional Legalization Algorithm Postplacement Design Closure Issue Novel Computational Geometry Clear Advantage Placement Migration Heat Distribution Critical Step |
| Content Type | Text |
| Resource Type | Article |
