C-sat: A parallel SAT solver for clusters

Kei Ohmura*, Kazunori Ueda

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings
Number of pages14
Publication statusPublished - 2009
Event12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009 - Swansea, United Kingdom
Duration: 2009 Jun 302009 Jul 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5584 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'C-sat: A parallel SAT solver for clusters'. Together they form a unique fingerprint.

Cite this