Combinatorial techniques for mixed-size placement

@article{Adya2005CombinatorialTF,
  title={Combinatorial techniques for mixed-size placement},
  author={S. Adya and I. Markov},
  journal={ACM Trans. Design Autom. Electr. Syst.},
  year={2005},
  volume={10},
  pages={58-90}
}
  • S. Adya, I. Markov
  • Published 2005
  • Computer Science
  • ACM Trans. Design Autom. Electr. Syst.
While recent literature on circuit layout addresses large-scale standard-cell placement, the authors typically assume that all macros are fixed. Floorplanning techniques are very good at handling macros, but do not scale to hundreds of thousands of placeable objects. Therefore we combine floorplanning techniques with placement techniques to solve the more general placement problem. Our work shows how to place macros consistently with large numbers of small standard cells. Proposed techniques… Expand
Unified analytical global placement for large-scale mixed-size circuit designs
TLDR
Unlike traditional analytical placement that uses only wire and density forces to optimize the positions of circuit components, this paper presents a new force, the rotation force, to handle macro orientation for analytical mixed-size placement. Expand
FastPlace: an analytical placer for mixed-mode designs
TLDR
The efficient analytical placement algorithm FastPlace is extended by integrating a simulated annealing based floorplanner to solve theglobal placement problem for mixed-mode designs and an efficient and effective detailed placement algorithm is presented to improve the wirelength of the global placement solution based on a greedy swapping heuristic. Expand
An Effective Floorplan-Guided Placement Algorithm for Large-Scale Mixed-Size Designs
TLDR
Compared with most state-of-the-art mixed-size placers and leading macroplacers, experimental results show that FLOP achieves the best HPWL and easily obtains legal solutions on all circuits with all geometry constraints satisfied. Expand
Constraint graph-based macro placement for modern mixed-size circuit designs
TLDR
A constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs and can consistently and significantly reduce the wirelengths for designs with different utilization rates is proposed, implying that the macro placer is robust and has very high quality. Expand
Constraint graph-based macro placement for modern mixed-size circuit designs
TLDR
A constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs and can consistently and significantly reduce the wirelengths for designs with different utilization rates is proposed, implying that the macro placer is robust and has very high quality. Expand
Considering The ffect Of Standard Cell Placement In Mi ed-Size Placement
Large-scale mixed-size placement gets more and more attention in recent years. Traditional placement algorithms for pure standard-cell placement or pure macro placement are not suitable to deal withExpand
Min-cut floorplacement
TLDR
The authors propose to integrate min-cut placement with fixed-outline floorplanning to solve the more general placement problem, which includes cell placement,floorplanning, mixed-size placement, and achieving routability. Expand
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
TLDR
A new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates and significantly reduces the average half-perimeter wirelength, and the routing overflows by 13 times compared with Capo 10.2, implying that the macro placer leads to much higher routability. Expand
Unification of partitioning, placement and floorplanning
TLDR
This work proposes to integrate min-cut placement with fixed-outline floor-planning to solve the more general placement problem, which includes cell placement, floorplanning, mixed-size placement and achieving routability, and proposes that free-shape rectilinear floor plannerning can be used with rough module-area estimates before synthesis. Expand
Unification of partitioning, placement and floorplanning
TLDR
This work proposes to integrate min-cut placement with fixed-outline floor-planning to solve the more general placement problem, which includes cell placement, floorplanning, mixed-size placement and achieving routability, and proposes that free-shape rectilinear floor plannerning can be used with rough module-area estimates before synthesis. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Consistent placement of macro-blocks using floorplanning and standard-cell placement
TLDR
This work shows how to place macros consistently with large numbers of small standard cells, and combines floorplanning techniques with placement techniques in adesign flow that solves the more general placement problem. Expand
Dragon2000: standard-cell placement tool for large industry circuits
  • Maogang Wang, Xiaojian Yang, M. Sarrafzadeh
  • Engineering, Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
  • 2000
TLDR
It is argued that net-cut minimization is a good and important shortcut to solve the large scale placement problem and is shown to be more important than greedily obtain a wirelength optimal placement at intermediate hierarchical levels. Expand
Unification of partitioning, placement and floorplanning
TLDR
This work proposes to integrate min-cut placement with fixed-outline floor-planning to solve the more general placement problem, which includes cell placement, floorplanning, mixed-size placement and achieving routability, and proposes that free-shape rectilinear floor plannerning can be used with rough module-area estimates before synthesis. Expand
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to classic Fiduccia-Mattheyses (FM)-based partitioning algorithms in the context of end-case processing for top-down standard-cell placement. While the divide step in theExpand
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to classic Fiduccia-Mattheyses (FM)-based partitioning algorithms in the context of end-case processing for top-down standard-cell placement. While the divide step in theExpand
Multi-level placement for large-scale mixed-size IC designs
TLDR
This paper develops a multi-level optimization algorithm, MPGMS, for this problem which can efficiently handle both large-scale designs and large size variations and can achieve 13% wirelength reduction on average with comparable runtime. Expand
Can recursive bisection alone produce routable, placements?
TLDR
The state-of-the-art after two decades of research in recursive bisection placement is summarized and a new placer is implemented, called Capo, to empirically study the achievable limits of the approach and validates fixed-die placement results by violation-free detailed auto-routability. Expand
Effective partition-driven placement with simultaneous level processing and global net views
  • Ke Zhong, S. Dutt
  • Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
  • 2000
TLDR
Empirical results indicate that the PDP algorithm SPADE (for Simultaneous level Partitioning with Distributed lie., global] nEt views) provides almost 202 better wirelength results than an internal version of "regular" PDP with min-cut based gains. Expand
Fixed-outline floorplanning: enabling hierarchical design
  • S. Adya, I. Markov
  • Engineering, Computer Science
  • IEEE Trans. Very Large Scale Integr. Syst.
  • 2003
TLDR
This paper studies the fixed-outline floorplan formulation that is more relevant to hierarchical design style and is justified for very large ASICs and SoCs and proposes new objective functions to drive simulated annealing and new types of moves that better guide local search in the new context. Expand
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis
TLDR
A state-of-the-art recursive bisection placer is tuned to betterhandle regular netlists that offer a convenient way to represent memories, datapaths and random-logic IP blocks and better whitespace distribution improve results on recent mixed-size placement benchmarks. Expand
...
1
2
3
4
5
...