sub-SAT: A formulation for relaxed boolean satisfiability with applications in routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 22, Issue 6, 2003, Pages 814-820

  Xu, Hui ^a   Rutenbar, Rob A ^a   Sakallah, Karem ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Boolean satisfiability

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; FIELD PROGRAMMABLE GATE ARRAYS; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY;

ROUTERS;

EID: 0038380249     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.811450     Document Type: Conference Paper

References (29)

1. R. E. Bryant, "Symbolic Boolean manipulation with ordered binary-decision diagrams," ACM Comput. Surv., vol. 24, no. 3, pp. 293-318, 1992.
2. K. S. Brace, R. R. Rudell, and R. E. Bryant, "Efficient implementation of a BDD package," in Proc. ACM/IEEE Design Automation Conf., Jan. 1990, pp. 40-45.
3. R. Rudell, "Dynamic variable ordering for binary decision diagrams," in Proc. ACM/IEEE Int. Conf. Computer-Aided Design, Nov. 1993, pp. 42-47.
4. S.-I. Minato, "Zero-suppressed BDD'S for set manipulation in combinatorial problems," in Proc. 30th ACM/IEEE Design Automation Conf., June 1993, pp. 272-277.
5. R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, "Algebraic decision diagrams and their applications," in Proc. ACM/IEEE Int. Conf. Computer-Aided Design, Nov. 1993, pp. 188-191.
6. A. Anuchitanukul, Z. Manna, and T. E. Uribe, "Differential BDDs," in Computer Science Today, Lecture Notes in Computer Science, J. van Leeuwen, Ed. Berlin, Germany: Springer-Verlag, Sept. 1995, vol. 1000, pp. 218-233.
7. R. E. Bryant, "Binary decision diagrams and beyond: enabling technologies for formal verification," in Proc. ACM/IEEE Int. Conf. Computer-Aided Design, Nov. 1995, pp. 236-243.
8. B. Yang, R. E. Bryant, D. R. O'Hallaron, A. Biere, O. Coudert, G. Janssen, R. K. Ranjan, and F. Somenzi, "A performance study of BDD-based model checking," in Proc. 2nd Int. Conf. Formal Methods Computer-Aided Design, Palo Alto, CA, Nov. 1998, pp. 255-289.
9. B. Selman, H. Kautz, and B. Cohen, "Local search strategies for satisfiability testing," in Proc. DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol. 26, 1996, pp. 521-532.
10. H. Zhang, "SATO: an efficient prepositional prover," in International Conference on Automated Deduction (CADE'97), LNAI 1249. Berlin, Germany: Springer-Verlag, 1997, pp. 272-275.
11. J. P. Marques-Silva and K. A. Sakallah, "GRASP: a search algorithm for propositional satisfiability," IEEE Trans. Comput., vol. 48, pp. 506-521, May 1999.
12. J. P. Marques-Silva and L. G. e Silva, "Algorithms for satisfiability in combinational circuits based on backtrack search and recursive learning," in Proc. 12th Symp. Integrated Circuits Syst. Design, Sept.-Oct. 1999, pp. 192-195.
13. Y. Zhao, L. Zhang, and S. Malik, "Chaff: engineering an efficient SAT solver," in Proc ACM/IEEE 39th Design Automation Conf., Las Vegas, June 2001, pp. 530-535.
14. M. Velev and R. E. Bryant, "Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors," in Proc. ACM/IEEE Design Automation Conf., June 2001, pp. 226-231.
15. S. Devadas, "Optimal layout via Boolean satisfiability," in Proc. ACM/IEEE Int. Conf. Computer-Aided Design, Nov. 1989, pp. 294-297.
16. R. G. Wood and R. A. Rutenbar, "FPGA routing and routability estimation via Boolean satisfiability," IEEE Trans. VLSI Syst., vol. 6, pp. 222-231, June 1998.
17. F. Schmiedle, D. Unruh, and B. Becker, "Exact switchbox routing with search space reduction," in Proc. ACM Int. Symp. Physical Design, Apr. 2000, pp. 26-32.
18. K. Sulimma and W. Kunz, "An exact algorithm for difficult detailed routing problems," in Proc. ACM Int. Symp. Physical Design, Apr. 2001, pp. 198-203.
19. G.-J. Nam, K. Sakallah, and R. A. Rutenbar, "Satisfiability-based layout revisited: routing complex FPGA'S via search-based Boolean SAT," in Proc. ACM Int. Symp. FPGAs, Feb. 1999, pp. 167-175.
20. G.-J. Nam, F. Aloul, K. Sakallah, and R. A. Rutenbar, "A comparative study of two Boolean formulations of FPGA detailed routing constraints," in Proc. ACM Int. Symp. Physical Design, Apr. 2001, pp. 222-227.
21. G.-J. Nam, K. Sakallah, and R. A. Rutenbar, "A Boolean satisfiability-based incremental rerouting approach with application to FPGAs," in Proc. Design Automation Test Eur., Mar. 2001, pp. 560-564.
22. G.-J. Nam, "A Boolean based layout approach and its application to fpga routing," Ph.D. dissertation, Dept. of Elect. Eng. Comp. Sci., Univ. of Michigan, Ann Arbor, MI, 2001.
23. H. Xu, R. A. Rutenbar, and K. Sakallah, "sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing," in Proc. Int. Symp. Physical Design, 2002, pp. 182-187.
24. P. Hansen and B. Jaumard, "Algorithms for the maximum satisfiability problem," Computing, vol. 44, pp. 279-303, 1990.
25. B. Cha, K. Iwama, Y. Kambayashi, and S. Miyazaki, "Local search algorithms for partial MAXSAT," in Proc. 14th Nat. Conf. Artificial Intell., 1997, pp. 263-268.
26. J. N. Hooker, "Resolution and the integrality of satisfiability problems," Math. Program., vol. 74, pp. 1-10, 1996.
27. http://www.eecg.toronto.edu/̃lemieux/sega/sega.html [Online]
28. http://dimacs.rutgers.edu/Challenges/ [Online]
29. D. A. Patterson and J. L. Hennessy, Computer Organization and Design. San Mateo, CA: Morgan Kaufmann, 1994, ch. 2.6, pp. 68-70.