Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Automated rip-up and reroute techniques
DAC '82 Proceedings of the 19th Design Automation Conference
An iterative technique for printed wire routing
DAC '74 Proceedings of the 11th Design Automation Workshop
DAC '79 Proceedings of the 16th Design Automation Conference
An iterative-improvement penalty-function-driven wire routing system
IBM Journal of Research and Development
A new hypergraph based rip-up and reroute strategy
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
An appreciation of simulated annealing to maze routing
EURO-DAC '94 Proceedings of the conference on European design automation
An investigation of iterative routing algorithms
EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
In this router, an iterative, non-sequential “supply/demand” router attempts to find conflict-free (non-crossing or overlapping) paths for each net. If 100% interconnection is not achieved with supply/demand routing, the rip-up procedure removes enough nets to eliminate all conflicts. Nets that are ripped-up are returned to the supply/demand router for re-routing. The new router was compared to a Lee-type router on six double-sided boards, and on average obtained 6.8% higher completion.