Multilevel approach to full-chip gridless routing

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 396-403

  Cong, J ^a   Fang, J ^a   Zhang, Y ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MICROPROCESSOR CHIPS; OPTIMIZATION; VLSI CIRCUITS;

FULL-CHIP GRIDLESS ROUTING;

ROUTERS;

EID: 0035212842     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. DUNE: A multi-layer gridless routing system with wire planning
2. Performance optimization of VLSI interconnect layout
3. A modification of Lee's path connection algorithm
4. Fast maze router
5. A computer program for optimal routing of printed circuit connectors
6. A solution to line routing problems on the continuous plane
7. A global router with a theoretical bound on the optimal solution
8. Provably good global routing by a new approximation algorithm for multicommodity flow
9. Performance driven multi-layer general area routing for PCB/MCM designs
10. The efficient solution of integer programs for hierarchical global routing
11. A new timing-driven multilayer mcm/ic routing algorithm
12. Interconnect estimation and planning for deep submicron designs
13. Timing and crosstalk driven area routing
14. Cross talk noise control in gridless general-area routing
15. Pseudo pin assignment with crosstalk noise control
16. Multi-level adaptive solution to boundary value problems
17. Multilevel hypergraph partitioning: Applications in VLSI domain
18. Performance driven multilevel and multiway partitioning with retiming
19. Multilevel optimization for large-scale circuit placement
20. GORDIAN: VLSI placement by quadratic programming and slicing optimization
21. An implicit connection graph maze routing algorithm for ECO routing
22. Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
23. An edge-based heuristic for Steiner routing
24. Routing tree construction under fixed buffer locations
25. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
26. Global wire routing in two-dimensional arrays
27. A note on two problems in connexion with graphs