A new interactive supply/demand router with rip-up capability for printed circuit boards
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Generic global placement and floorplanning
DAC '98 Proceedings of the 35th annual Design Automation Conference
Performance driven multi-layer general area routing for PCB/MCM designs
DAC '98 Proceedings of the 35th annual Design Automation Conference
Timing and crosstalk driven area routing
DAC '98 Proceedings of the 35th annual Design Automation Conference
An interactive maze router with hints
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A sequential detailed router for huge grid graphs
Proceedings of the conference on Design, automation and test in Europe
A force-directed macro-cell placer
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Wire Ordering for Detailed Routing
IEEE Design & Test
Net by Net Routing with a New Path Search Algorithm
SBCCI '00 Proceedings of the 13th symposium on Integrated circuits and systems design
High Performance MCM Routing: A New Approach
VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
A global router for sea-of-gates circuits
EURO-DAC '91 Proceedings of the conference on European design automation
Via design rule consideration in multilayer maze routing algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient multilayer MCM router based on four-via routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Benchmarking for large-scale placement and beyond
Proceedings of the 2003 international symposium on Physical design
Improved global routing through congestion estimation
Proceedings of the 40th annual Design Automation Conference
| Hi-index | 0.00 |
A new routing algorithm is presented. It is based on a multiple star net model, force-directed placement and maze searching techniques. The algorithm inherits the power of maze routing in that it is able to route complex layouts with various obstructions. The large memory requirement of the conventional maze algorithm is alleviated through successive net refinement, which constrains the maze searching to small regions. The algorithm shows advantages in routing designs with complicated layout obstructions.