This paper illustrates the design and implementation of a prototype ASP solver that is capable of exploiting the parallelism offered by general purpose graphical processing units (GPGPUs). The solver is based on a basic conflictdriven search algorithm. The core of the solving process develops on the CPU, while most of the activities, such as literal selection, unit propagation, and conflictanalysis, are delegated to the GPU. Moreover, a deep non-deterministic search, involving a very large number of threads, is also delegated to the GPU. The initial results confirm the feasibility of the approach and the potential offered by GPUs in the context of ASP computations.
CUD@ASP: Experimenting with GPUs in ASP solving / Vella, F.; Dal Palu, A.; Dovier, A.; Formisano, A.; Pontelli, E.. - ELETTRONICO. - 1068:(2013), pp. 163-177. (Intervento presentato al convegno 28th Italian Conference on Computational Logic, CILC 2013 tenutosi a Catania, Italy nel 25-27 September 2013).
CUD@ASP: Experimenting with GPUs in ASP solving
Vella F.;
2013-01-01
Abstract
This paper illustrates the design and implementation of a prototype ASP solver that is capable of exploiting the parallelism offered by general purpose graphical processing units (GPGPUs). The solver is based on a basic conflictdriven search algorithm. The core of the solving process develops on the CPU, while most of the activities, such as literal selection, unit propagation, and conflictanalysis, are delegated to the GPU. Moreover, a deep non-deterministic search, involving a very large number of threads, is also delegated to the GPU. The initial results confirm the feasibility of the approach and the potential offered by GPUs in the context of ASP computations.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
