Dune - A multilayer gridless routing system

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 20, Issue 5, 2001, Pages 633-647

  Cong, Jason ^a,b   Fang, Jie ^b   Khoo, Kei Yong ^a,c,d  

^a IEEE   (United States)

^b Department of Civil and Environmental Engineering   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Verplex Systems Inc   (United States)

Author keywords

Deep submicrometer; Gridless routing; Routing

Indexed keywords

GRIDLESS ROUTING;

ALGORITHMS; BUFFER STORAGE; CONGESTION CONTROL (COMMUNICATION); DATA STRUCTURES; GRAPH THEORY; VLSI CIRCUITS;

ROUTERS;

EID: 0035334707     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.920694     Document Type: Article

References (40)

1. Performance optimization of VLSI interconnect layout
2. Interconnect estimation and planning for deep submicron designs
3. Planning for performance
4. Planning for performance
5. Interconnect delay estimation models for synthesis and design planning
6. Performance driven multilayer general area routing for PCB/MCM designs
7. Cross talk noise control in gridless general-area routing
8. Pseudo pin assignment with crosstalk noise control
9. An algorithm for path connections and its applications
10. A shortest path algorithm for grid graphs
11. Fast maze router
12. A fast line-search method based on a tile plane
13. A tile-expansion router
14. Chip-level area routing
15. Corner stitching: A data-structuring technique for VLSI layout tools
16. Gridless routers - New wire routing algorithms based on computational geometry
17. Silk: A simulated evolution router
18. Touch and cross router
19. Pathfinder: A negotiation-based performance-driven router for FPGAs
20. An implicit connection graph maze routing algorithm for ECO routing
21. DUNE: A multilayer gridless routing system with wire planning
22. Optimal two-terminal α - β wire routing
23. On routing two-terminal nets in the presence of obstacles
24. Finding obstacle-avoiding shortest paths using implicit connection graphs
25. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles
26. A gridless router for industrial design rules
27. Rectilinear paths among rectilinear obstacles
28. Computing point enclosures
29. Priority search trees
30. Practical data structure for incremental design rule checking and compaction
31. A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
32. A method of pattern data management of PWB layout system
33. Recent advances in VLSI layout
34. A new approach to rectangle intersections
35. Plane-sweep algorithms for intersecting geometric figures
36. Maze router without a grid map
37. An interactive maze router with hints
38. Magic: A VLSI layout system