Parallel Resolution of the Satisfiability Problem: A Survey

Singer, Daniel

doi:10.1002/9780470053928.ch5

Cited by 13 publications

(12 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work closes that gap by presenting an overview of parallel SAT solving. Similar work was presented by Singer [93]. However, at that time there was almost no research done in parallel SAT solving for shared memory architectures.…”

mentioning

confidence: 58%

An overview of parallel SAT solving

2012

View full text Add to dashboard Cite

mentioning

confidence: 58%

An overview of parallel SAT solving

2012

View full text Add to dashboard Cite

“…Indeed, the challenge to parallel processing is substantial in this area because there are still many problems considered out of reach for the best currently available solvers. We refer to [28] for a recent review of Parallel Resolution of SAT with complete algorithms, but we outline in this section the major progresses in this direction. An important characteristic of the SAT search space is that it is hard to predict the time needed to complete a specific branch.…”

Section: Parallel Resolution Of Satmentioning

confidence: 99%

“…In spite of its computational complexity, there is increasing demand for high performance SATsolving algorithms in industry. Unfortunately, most modern solvers are sequential and fewer are parallel (see [28] for a complete review on parallel resolution of SAT).…”

Section: Introductionmentioning

confidence: 99%

Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI

Singer¹,

Vagner²

2006

Parallel Processing and Applied Mathematics

Self Cite

View full text Add to dashboard Cite

Abstract. The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solving, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel.A number of recent propositions was concerned with dynamic workload balancing for parallel SAT solving. Here, it is a complementary approach that only explores an initial static decomposition for workload repartition. The two computational models of Shared Memory and Message Passing are compared, using OpenMP for Shared Memory and MPI for Message Passing implementations.

show abstract

“…Although rapid progress has been made in SAT solvers, most are sequential and few are parallel [9], and are thus limited to the capabilities of a single workstation. In order to enable the solution of very large sets of SAT equations (such as those derived from large biologically-originated graphs), we need the parallel processing capabilities and large aggregated memory spaces of HPC systems.…”

Section: Parallel Implementation Of Survey Propagationmentioning

confidence: 99%

A High-Performance Computational Framework for BionetworkAnalysis

Chin¹,

Chavarria²,

Nakamura³

et al. 2007

Second International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2007)

View full text Add to dashboard Cite

We introduce BioGraphE, a general, scaleable integration platform for connecting graph problems in biology to computational solvers and highperformance systems. This framework will enable computational scientists to identify and bring in graph analysis applications and to easily connect them to efficient and powerful computational software and hardware that are specifically designed and tuned to solve complex graph problems. We investigate the use of a Boolean satisfiability solver known as Survey Propagation as a core computational solver and highperformance parallel systems that utilize multithreaded processor architectures. Second International Multisymposium on Computer and Computational Sciences0-7695-3039-7/07 $25.00

show abstract

Parallel Resolution of the Satisfiability Problem: A Survey

Cited by 13 publications

References 42 publications

An overview of parallel SAT solving

An overview of parallel SAT solving

Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI

A High-Performance Computational Framework for BionetworkAnalysis

Contact Info

Product

Resources

About