Parallel propositional satisfiability checking with distributed dynamic learning

Authors:
Wolfgang Blochinger;Carsten Sinz;Wolfgang Küchlin
Affiliations:
Symbolic Computation Group, Wilhelm-Schickard-Institute, University of Tübingen, Sand 14, 72076 Tübingen, Germany;Symbolic Computation Group, Wilhelm-Schickard-Institute, University of Tübingen, Sand 14, 72076 Tübingen, Germany;Symbolic Computation Group, Wilhelm-Schickard-Institute, University of Tübingen, Sand 14, 72076 Tübingen, Germany
Venue:
Parallel Computing
Year:
2003

Citing 23
Cited 19

Programming languages for distributed computing systems

ACM Computing Surveys (CSUR)
Randomized parallel algorithms for backtrack search and branch-and-bound computation

Journal of the ACM (JACM)
PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
The Nexus approach to integrating multithreading and communication

Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
MILLIPEDE: easy parallel programming in available distributed environments

Software—Practice & Experience
Models and languages for parallel computation

ACM Computing Surveys (CSUR)
Solving large-scale QAP problems in parallel with the search library ZRAM

Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
An object-oriented platform for distributed high-performance symbolic computation

Mathematics and Computers in Simulation - Special issue on high performance symbolic computing
virtual data space—load balancing for irregular applications

Parallel Computing - special issue on parallel computing for irregular applications
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Distributed Systems: Principles and Paradigms

Distributed Systems: Principles and Paradigms
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
State of the Art in Parallel Search Techniques for Discrete Optimization Problems

IEEE Transactions on Knowledge and Data Engineering
Distributed High Performance Computing in Heterogeneous Environments with DOTS

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Distributed Symbolic Computation with DTS

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Athapascan Runtime: Efficiency for Irregular Problems

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Load Balancing strategies for Parallel Forward Search Algorithm with Conflict Based Backjumping

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Conflict Analysis in Search Algorithms for Satisfiability

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Cilk: efficient multithreaded computing

Cilk: efficient multithreaded computing

Visualizing structural properties of irregular parallel computations

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Lemma Exchange in a Microcontroller Based Parallel SAT Solver

ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Visualization aided performance tuning of irregular task-parallel computations

Information Visualization
A competitive and cooperative approach to propositional satisfiability

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
d-TSR: Parallelizing SMT-Based BMC Using Tunnels over a Distributed Framework

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
c-sat: A Parallel SAT Solver for Clusters

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Experiences Running a Parallel Answer Set Solver on Blue Gene

Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Control-based clause sharing in parallel SAT solving

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling

Computer Languages, Systems and Structures
From idempotent generalized boolean assignments to multi-bit search

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Diversification and intensification in parallel SAT solving

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Partitioning SAT instances for distributed solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Grid-based SAT solving with iterative partitioning and clause learning

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
PLATYPUS: a platform for distributed answer set solving

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A distribution method for solving SAT in grids

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving

Constraints
Partitioning Search Spaces of a Randomized Search

Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Multi-threaded asp solving with clasp

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the parallelization and distributed execution of an algorithm from the area of symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our parallel programming models are strict multithreading for the core SAT checking procedure, complemented by mobile agents realizing a distributed dynamic learning process. Individual threads treat dynamically created subproblems, while mobile agents collect and distribute pertinent knowledge obtained during the learning process. The parallel algorithm runs on top of our parallel system platform Distributed Object-Oriented Threads System, which provides support for our parallel programming models in highly heterogeneous distributed systems. We present performance measurements evaluating the performance gains by our approach in different application domains with practical significance.