Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI.
Daniel SingerAlain VagnerPublished in: PPAM (2005)
Keyphrases
- satisfiability problem
- shared memory
- parallel programming
- message passing interface
- parallel computing
- distributed memory
- parallel algorithm
- np complete
- message passing
- high performance computing
- sat problem
- search algorithm
- clause learning
- massively parallel
- phase transition
- parallel implementation
- temporal logic
- stochastic local search algorithms
- solving hard
- multi core processors
- parallel computation
- parallel architectures
- parallel processing
- parallel execution
- parallelization strategy
- sat instances
- stochastic local search
- davis putnam
- max sat
- processing units
- davis putnam logemann loveland
- conjunctive normal form
- randomly generated
- belief propagation
- model checking
- multithreading
- np hard