Abstract
Routing for high-speed boards is largely a time- consuming manual task today. The ordered escape routing problem is one of the key problems in board-level routing, and Boolean Satisfiability (SAT) based approach [1] is the only solution to this problem so far. In this paper, we first solve the major deficiency of the original SAT formulation so that the escape problem is completely resolved. Then we propose two techniques to extend SAT approach for large-scale problems. Experimental results on industrial benchmarks show that our methods perform well in terms of both speed and routability.
Original language | English |
---|---|
Title of host publication | Proceedings of the 14th Asia and South Pacific Design Automation Conference, ASP-DAC 2009 |
Publisher | IEEE |
Pages | 594-599 |
Number of pages | 6 |
ISBN (Print) | 9781424427482 |
DOIs | |
Publication status | Published - 21 Jan 2009 |
Event | 14th Asia and South Pacific Design Automation Conference, ASP-DAC 2009 - Pacifico Yokohama, Yokohama, Japan Duration: 19 Jan 2009 → 22 Jan 2009 https://www.aspdac.com/aspdac2009/ (Conference website) https://www.aspdac.com/aspdac2009/pdf/finalprog09printnosign.pdf (Conference program ) https://ieeexplore.ieee.org/xpl/conhome/4781528/proceeding (Conference proceedings) |
Publication series
Name | Proceedings of The Asia and South Pacific Design Automation Conference, ASP-DAC |
---|---|
ISSN (Print) | 2153-6961 |
ISSN (Electronic) | 2153-697X |
Conference
Conference | 14th Asia and South Pacific Design Automation Conference, ASP-DAC 2009 |
---|---|
Country/Territory | Japan |
City | Yokohama |
Period | 19/01/09 → 22/01/09 |
Internet address |
|
Scopus Subject Areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering