Ordered escape routing based on Boolean satisfiability

Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardlevel routing. All existing approaches to this problem cannot guarantee to find a routing solution even if one exists. We present an algorithm to exactly solve this problem based on Boolean satisfiability. Experimental results on escape routing problems from industry show that our algorithm performs well.

• Type: Conference
• Year: 2008
• Where: ASPDAC
• Authors: Lijuan Luo, Martin D. F. Wong
• Keywords: ASPDAC 2008, Escape Routing Problems, Hardware, Manual Task Today, Routing