Skip to main content
SpringerLink
Log in

Designing Scalable Parallel SAT Solvers

  • Conference paper
Theory and Applications of Satisfiability Testing – SAT 2012 (SAT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7317))

Abstract

Solving instances of the propositional satisfiability problem (SAT) in parallel has received a significant amount of attention as the number of cores in a typical workstation is steadily increasing. With the increase of the number of cores, in particular the scalability of such approaches becomes essential for fully harnessing the potential of modern architectures. The best parallel SAT solvers have, until recently, been based on algorithm portfolios, while search-space partitioning approaches have been less successful. We prove, under certain natural assumptions on the partitioning function, that search-space partitioning can always result in an increased expected run time, justifying the success of the portfolio approaches. Furthermore, we give first controlled experiments showing that an approach combining elements from partitioning and portfolios scales better than either of the two approaches and succeeds in solving instances not solved in a recent solver competition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. STOC 1971, pp. 151–158. ACM (1971)

    Google Scholar 

  2. Béjar, R., Manyà, F.: Solving the round robin problem using propositional logic. In: Proc. AAAI 2000, pp. 262–266. AAAI Press/MIT Press (2000)

    Google Scholar 

  3. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT Solving for Termination Analysis with Polynomial Interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340–354. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proc. ECAI 1992, pp. 359–363. John Wiley and Sons (1992)

    Google Scholar 

  5. Lynce, I., Marques-Silva, J.: SAT in Bioinformatics: Making the Case with Haplotype Inference. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 136–141. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Partitioning SAT Instances for Distributed Solving. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 372–386. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters 47(4), 173–180 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Rao, V.N., Kumar, V.: On the efficiency of parallel backtracking. IEEE Transactions on Parallel and Distributed Systems 4(4), 427–437 (1993)

    Article  Google Scholar 

  9. Luby, M., Ertel, W.: Optimal Parallelization of Las Vegas Algorithms. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 463–474. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  10. Segre, A.M., Forman, S.L., Resta, G., Wildenberg, A.: Nagging: A scalable fault-tolerant paradigm for distributed search. Artificial Intelligence 140(1/2), 71–106 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Partitioning search spaces of a randomized search. Fundamenta Informaticae 107(2-3), 289–311 (2011)

    MathSciNet  MATH  Google Scholar 

  12. Böhm, M., Speckenmeyer, E.: A fast parallel SAT-solver — efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(3-4), 381–400 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Sinz, C., Blochinger, W., Küchlin, W.: PaSAT — parallel SAT-checking with lemma exchange: Implementation and applications. In: Proc. SAT 2001. Electronic Notes in Discrete Mathematics, vol. 9. Elsevier (2001)

    Google Scholar 

  14. Schubert, T., Lewis, M., Becker, B.: PaMiraXT: Parallel SAT solving with threads and message passing. Journal on Satisfiability, Boolean Modeling and Computation 6(4), 203–222 (2009)

    MATH  Google Scholar 

  15. Heule, M.J., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: Guiding CDCL SAT solvers by lookaheads. In: Proc. HVC 2001. Springer (2011) (to appear)

    Google Scholar 

  16. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51–54 (1997)

    Article  Google Scholar 

  17. Hamadi, Y., Jabbour, S., Saïs, L.: ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 6(4), 245–262 (2009)

    MATH  Google Scholar 

  18. Hamadi, Y., Jabbour, S., Saïs, L.: Control-based clause sharing in parallel SAT solving. In: Proc. IJCAI 2009, pp. 499–504. IJCAI/AAAI (2009)

    Google Scholar 

  19. Guo, L., Hamadi, Y., Jabbour, S., Sais, L.: Diversification and Intensification in Parallel SAT Solving. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 252–265. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Incorporating clause learning in grid-based randomized SAT solving. Journal on Satisfiability, Boolean Modeling and Computation 6, 223–244 (2009)

    MATH  Google Scholar 

  21. Hyvärinen, A.E.J., Junttila, T.A., Niemelä, I.: A Distribution Method for Solving SAT in Grids. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 430–435. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 385–399. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  23. Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation 21(4-6), 543–560 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  24. Hyvärinen, A.E.J.: Grid Based Propositional Satisfiability Solving. PhD thesis, Aalto University (2011)

    Google Scholar 

  25. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. DAC 2001, pp. 530–535. ACM (2001)

    Google Scholar 

  26. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, Aalto University, P.O. Box 15400, FI-00076, Aalto, Finland

    Antti E. J. Hyvärinen

  2. Knowledge Representation and Reasoning Group, Technische Universität Dresden, 01062, Dresden, Germany

    Norbert Manthey

Authors
  1. Antti E. J. Hyvärinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norbert Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Information Technology, Fondazione Bruno Kessler, via Sommarive 18, Povo, 38123, Trento, Italy

    Alessandro Cimatti

  2. Department of Information Engineering and Computer Science, University of Trento, via Sommarive 14, Povo, 38123, Trento, Italy

    Roberto Sebastiani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hyvärinen, A.E.J., Manthey, N. (2012). Designing Scalable Parallel SAT Solvers. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31612-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31611-1

  • Online ISBN: 978-3-642-31612-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation