ySAT

Parallel Multithreaded Satisfiability Solver:

Design and Implementation

Abstract

This work describes the design and implementation of a highly optimized, multithreaded algorithm for the propositional satisfiability problem. The algorithm is based on the Davis-Logemann-Loveland sequential algorithm, but includes many of the optimization techniques introduced in recent years. The documents below provide experimental results for the execution of the parallel algorithm on a variety of multiprocessor machines with shared memory architecture. In particular, the overwhelming effect of parallel execution on the performance of processor cache is studied.

Documentation

C++ sources