Journal of Grid Computing

, Volume 8, Issue 3, pp 443–471

Parallel SAT Solving on Peer-to-Peer Desktop Grids


DOI: 10.1007/s10723-010-9160-1

Cite this article as:
Schulz, S. & Blochinger, W. J Grid Computing (2010) 8: 443. doi:10.1007/s10723-010-9160-1


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 multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids, Satciety achieves considerable speedups compared to state-of-the-art sequential SAT solvers.


SAT SolvingDesktop GridPeer-to-PeerDistributed systems

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.Institute of Parallel and Distributed SystemsUniversity of StuttgartStuttgartGermany