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.
Later several dozen cryptanalysis instances for this cipher were solved in the SAT@home volunteer computing project REF .
USING BOINC DESKTOP GRID TO SOLVE LARGE SCALE SAT PROBLEMS
Computer Science
Computer Science (AGH)
Computer Science