Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ASPDAC
2008
ACM

favoriteEmaildiscussreport

93views Hardware» more ASPDAC 2008»

Ordered escape routing based on Boolean satisfiability

13 years 6 months ago

Ordered escape routing based on Boolean satisfiability

Download www.cecs.uci.edu

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.

Lijuan Luo, Martin D. F. Wong

Real-time Traffic

ASPDAC 2008 | Escape Routing Problems | Hardware | Manual Task Today | Routing |

claim paper

Related Content

» SatisfiabilityBased Detailed FPGA Routing

» Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems

» Context and pathsensitive memory leak detection

» Algorithms for Maximum Satisfiability using Unsatisfiable Cores

» MaxSolver An efficient exact algorithm for weighted maximum satisfiability

» Boardlevel multiterminal net assignment

» Efficient SAT solving for nonclausal formulas using DPLL graphs and watched cuts

» Refining the SAT decision ordering for bounded model checking

» Reduction of interpolants for logic synthesis

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	ASPDAC
Authors	Lijuan Luo, Martin D. F. Wong

Comments (0)