A new approach to parallel SAT solvers
Name
870968306-MIT.pdf
Description
Full printable version
Size
4.26 MB
Format
Adobe PDF
Checksum (MD5)
eb3db6b5330dc44a9b6953dd1e100e38
Author(s)
Nelson, Max (Max M.)
Advisor(s)
Armando Solar-Lezama.
Alternative Title
New parallel approach to the Boolean satisfiability problem (SAT)
New approach to parallel Boolean satisfiability problem solvers
Date Issued
2013
Publisher
Massachusetts Institute of Technology
Abstract
We present a novel approach to solving SAT problems in parallel by partitioning the entire set of problem clauses into smaller pieces that can be solved by individual threads. We examine the complications that arise with this partitioning, including the idea of global variables, broadcasting global conflict clauses, and a protocol to ensure correctness. Along with this algorithm description, we provide the details of a C++ implementation, ParallelSAT, with a few specific optimizations. Finally, we demonstrate that this approach provides a significant speedup on a set of SAT problems related to program analysis.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 71-72).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
