z-logo
open-access-imgOpen Access
PaMiraXT: Parallel SAT Solving with Threads and Message Passing
Author(s) -
Tobias Schubert,
Matthew Lewis,
Bernd Becker
Publication year - 2009
Publication title -
journal on satisfiability boolean modeling and computation
Language(s) - English
Resource type - Journals
eISSN - 1875-5011
pISSN - 1574-0617
DOI - 10.3233/sat190068
Subject(s) - computer science , parallel computing
This article describes PaMiraXT, a powerful parallel SAT algorithm. PaMiraXT follows a master/client model based on message passing, making it suitable for any kind of workstation cluster. For the clients, MiraXT is used, which itself is thread-based parallel solver designed to take advantage of current and future shared memory multiprocessor systems. We highlight design and implementation details that allow the threads/clients to run and cooperate efficiently. Experimental results show that MiraXT compares well to other state-of-the-art SAT algorithms. In single-threaded mode, it outperforms MiniSat2, PicoSAT 535, and RSat 2.01, while in multi-threaded mode, MiraXT provides cutting edge performance, as it solves significantly more instances within the given time limit. A case study, using three copies of MiraXT with a total of 8 threads as clients, underlines the potential of PaMiraXT, resulting in a speedup of 5.62 on the industrial benchmarks of the 2007 SAT competition.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom