Parallelizing SATZ using dynamic workload balancing

MaRDI QIDQ2741522zbMATH OpenFDO

Authors Bernard Jurkowiak, Chu-Min Li, Gil Utard

Publication date 24 September 2001

zbMATH Keywords

master/slave communication model

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Recommendations

• A parallelization scheme based on work stealing for a class of SAT solvers
• A fast parallel SAT-solver -- efficient workload balancing
• scientific article; zbMATH DE number 1002950
• scientific article; zbMATH DE number 5613972
• ManySAT: a parallel SAT solver

Cites work

• A constraint-based approach to narrow search trees for satisfiability
• A machine program for theorem-proving
• scientific article; zbMATH DE number 1149403 (Why is no real title available?)
• scientific article; zbMATH DE number 2000365 (Why is no real title available?)
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• Parallel Search Algorithms for Discrete Optimization Problems
• PSATO: A distributed propositional prover and its application to quasigroup problems
• The complexity of theorem-proving procedures

Cited in

(8)

• A fast parallel SAT-solver -- efficient workload balancing
• GridSAT: Design and implementation of a computational grid application
• An overview of parallel SAT solving
• scientific article; zbMATH DE number 1432339 (Why is no real title available?)
• Challenges in Constraint-Based Analysis of Hybrid Systems
• A parallelization scheme based on work stealing for a class of SAT solvers
• A collaborative approach for multi-threaded SAT solving
• A competitive and cooperative approach to propositional satisfiability

Describes a project that uses

Uses Software

• PSATO
• SATO
• XtremWeb

This page was built for publication: Parallelizing SATZ using dynamic workload balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741522)