dSyrup is an original distributed SAT solver based on the portfolio paradigm. This solver, dedicated to work on plenty of cores, implements a new fully hybrid distributed programming model from Syrup. dSyrup uses a hybrid programming model. In hybrid models, processes running on the same computer communicate via shared memory (pthreads) and messages (MPI) are used only to communicate between computers. By default, dSyrup use the concurrent parallel strategy, but we have also implemented the dynamic Divide and Conquer strategy.

MIT    Any category    CSP & SAT Provers   

  • 2017 Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary, A Distributed Version of Syrup in 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17), pp. 215-232, 2017.