USING BOINC DESKTOP GRID TO SOLVE LARGE SCALE SAT PROBLEMS

Mikhail Posypkin, Alexander Semenov, Oleg Zaikin

Abstract


Many practically important combinatorial problems can be efficiently reduced
to a problem of Boolean satisfiability (SAT). Therefore, the implementation of
distributed algorithms for solving SAT problems is of great importance. In this
article we describe a technology for organizing desktop grid, which is meant
for solving SAT problems. This technology was implemented in the form of
a volunteer computing project SAT@home based on a popular BOINC platform.

Keywords


desktop grid, Boolean satisfiability problem (SAT), volunteer computing, BOINC

Full Text:

PDF


DOI: http://dx.doi.org/10.7494/csci.2012.13.1.25

Refbacks

  • There are currently no refbacks.