This talk presents the practical and theoretical importance of the propositional satisfiability problem. It details the common architecture used by modern sequential solvers, and discusses several solutions to effectively parallelize this architecture. Finally, it details the ManySAT solver, winners of the parallel track of the 2008 SAT-Race.
