CUD@SAT: SAT solving on GPUs

Abstract

The parallel computing power offered by graphic processing units (GPUs) has been recently exploited to support general purpose applications - by exploiting the availability of general API and the single-instruction multiple-thread-style parallelism present in several classes of problems (e.g. numerical simulations and matrix manipulations) - where relatively simple computations need to be applied to all items in large sets of data. This paper investigates the use of GPUs in parallelising a class of search problems, where the combinatorial nature leads to large parallel tasks and relatively less natural symmetries. Specifically, the investigation focuses on the well-known satisfiability testing (SAT) problem and on the use of the NVIDIA compute unified device architecture, one of the most popular platforms for GPU computing. The paper explores ways to identify strong sources of GPU-style parallelism from SAT solving. The paper describes experiments with different design choices and evaluates the results. The outcomes demonstrate the potential for this approach, leading to one order of magnitude of speedup using a simple NVIDIA platform

A declarative concurrent system for protein structure prediction on GPU

“…Finally, we would like to mention that the use of GPU architectures has shown its advantages in several other bioinformatics applications, such as computational proteomics (Hussong, Gregorius, Tholey, & Hildebrandt, 2009), DNA sequencing (Schatz, Trapnell, Delcher, & Varshney, 2007) and molecular docking (Sukhwani & Herbordt, 2009), as well as in the context of CP and SAT solving (Campeotto, Dovier, Fioretto, & Pontelli, 2014;Dal Palù, Dovier, Formisano, & Pontelli, 2014).…”

Distributed multi-agent optimization for smart grids and home automation

“…The line of work in this paper, focused on using GPUs to improve performance of DCOP solvers, extends recent approaches to make use of GPUs to enhance performance of constraint solves [4,5,7,10].…”

“…We evaluate the proposed algorithms on 5 standard IEEE Bus Systems, 7 all having non-convex solution spaces, and ranging from 5 to 118 buses.…”

Experimenting with Constraint Programming on GPU

“…In subsequent applications, GPU has been used to perform local search heuristics like Adaptive Search [2] and Large Neighborhood Search [4]. GPU was also used for SAT problem [14], in detail the GPU was used to parallelize the unit-propagation and the exploration of the search tree's low part.…”