Parallel Multithreaded Satisfiability Solver: Design and Implementation | Zendy

Yulik Feldman | Zendy; Nachum Dershowitz | Zendy; Ziyad Hanna | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Multithreaded Satisfiability Solver: Design and Implementation

Author(s) -

Yulik Feldman,

Nachum Dershowitz,

Ziyad Hanna

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.10.020

Subject(s) - computer science , parallel computing , dpll algorithm , multiprocessing , satisfiability , multithreading , boolean satisfiability problem , solver , variety (cybernetics) , theoretical computer science , programming language , thread (computing) , telecommunications , phase locked loop , jitter , artificial intelligence

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research