Parallel SAT Solving on Peer-to-Peer Desktop Grids

Abstract

Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing-Peer-to-Peer Desktop Grids. Satciety efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multistage SAT formula preprocessing, context-aware memory management, and adaptive topologyaware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids, Satciety achieves considerable speedups compared to state-of-the-art sequential SAT solvers.

An overview of parallel SAT solving

“…Therefore, it combines search splitting with a portfolio of algorithms for each subspace of the search tree. -Satciety [88]: It is the first parallel solver with clause exchange for Desktop…”

“…On the other hand, oblique splits occur when the resulting subspaces are small. To reduce the impact of bad splits, Schulz and Blochinger [88] propose a heuristic that tracks the quality of the split operations performed during the solving process. The notion of quality is based on balancedness of the runtime of the generated subspaces.…”

Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

“…Thus, it can be considered highly questionable whether one can actually use Desktop Grids for these classes of applications. However, there are already several examples where task parallel applications with complex interaction, like discrete optimization [2] and SAT solving [3], have been successfully deployed on Desktop Grids. Our aim is to foster further research on such superordinate questions.…”

Dolius: A Distributed Parallel SAT Solving Framework

“…Schulz and Blochinger [23] have proposed an original approach to distribute SAT. Indeed, in contrast to most other distributed techniques where a central point (often called master) is needed, their contribution consists in proposing a full peer-to-peer (P2P) system, where all workers play exactly the same role, without any need of centralization.…”

“…Indeed, in contrast to most other distributed techniques where a central point (often called master) is needed, their contribution consists in proposing a full peer-to-peer (P2P) system, where all workers play exactly the same role, without any need of centralization. The resulting P2P system is called SatCiety [23].…”