Algorithms for simultaneous satisfaction of multiple constraints and objective optimization in a placement flow with application to congestion control

Proceedings - Design Automation Conference

Volumn , Issue , 2002, Pages 854-859

  Zhong, Ke ^a   Dutt, Shantanu ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

Congestion reduction; Connector generation; Intermediate relaxation; Minimization of objective deterioration; Multi constraint satisfaction; Partitioning driven placement

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; ROUTERS;

PARTITIONING DRIVEN PLACEMENT (PDP) PROCESS;

VLSI CIRCUITS;

EID: 0036044627     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513918.514129     Document Type: Conference Paper

References (16)

1. A procedure for placement of standard-cell VLSI circuits
2. Probability-based Approaches to VLSI Circuit Partitioning
3. Partitioning around roadblocks: Tackling constraints with intermediate relaxations
4. Generic global placement and floorplanning
5. Exploring the design space for building block placements considering area, aspect ratio, path delay and routing congestion
6. Partitioning-based stasadard-cell global placement with an exact objective
7. Cost minimization of partitions into multiple devices
8. Congestion-driven placement using a new multi-partitioning heuristic
9. Congestion-driven quadratic placement
10. Efficient and effective placement for very large circuits
11. Dragon2000: Fast standard-cell placement for large circuits
12. Congestion minimization during placement
13. Congestion reduction during placement based on integer programming
14. Effective partition-driven placement with simultaneous level processing and global net views
15. Global routing with crosstalk constraints