c-sat: A Parallel SAT Solver for Clusters

  • Kei Ohmura
  • Kazunori Ueda
Conference paper

DOI: 10.1007/978-3-642-02777-2_47

Volume 5584 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ohmura K., Ueda K. (2009) c-sat: A Parallel SAT Solver for Clusters. In: Kullmann O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg

Abstract

Parallelizing modern SAT solvers for clusters such as Beowulf is an important challenge both in terms of performance scalability and stability. This paper describes a SAT Solver c-sat, a parallelization of MiniSat using MPI. It employs a layered master-worker architecture, where the masters handle lemma exchange, deletion of redundant lemmas and the dynamic partitioning of search trees, while the workers do search using different decision heuristics and random number seeds. With careful tuning, c-sat showed good speedup over MiniSat with reasonably small communication overhead on various clusters. On an eight-node cluster with two Dual-Core Opterons on each node (32 PEs), c-sat ran at least 23 times faster than MiniSat using 31 PEs (geometric mean; at least 31 times for satisfiable problems) for 189 large-scale problems from SAT Competition and two SAT-Races.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Kei Ohmura
    • 1
  • Kazunori Ueda
    • 1
  1. 1.Dept. of Computer Science and EngineeringWaseda UniversityTokyoJapan