Timing driven placement using physical net constraints

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 780-783

  Halpin, Bill ^a   Chen, C Y Roger ^b   Sehgal, Naresh ^a  

^a INTEL CORPORATION   (United States)

^b SYRACUSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LINEAR PROGRAMMING; OPTIMIZATION;

RECURSIVE BISECTION PLACEMENT (RBP); TIMING CRITICAL NETS;

VLSI CIRCUITS;

EID: 0034841992     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2001.156242     Document Type: Article

References (18)

1. A fast algorithm for performance-driven placement
2. Getting to the Bottom of Deep Submicron
3. Timing driven placement for large standard cell circuits
4. Efficient and effective placement for very large circuits
5. Ritual: Performance driven placement algorithm for small cell ICs
6. Gordian: VLSI placement by quadratic programming and slicing optimization
7. Iterative placement improvement by network flow methods
8. Generic global placement and floorplanning
9. Timing models for interconnects and devices
10. Timing-driven placement
11. Timing-driven placement based on partitioning with dynamic cut-net control
12. Mongrel: Hybrid techniques for standard cell placement
13. A sensitivity based placer for standard cells
14. An analytic net weighting approach for performance optimization in circuit placement