This article presents a distributed version of the ADJSOLVER algorithm for computing the answer sets of logic programs. ADJSOLVER operates a classical branch-and-bound structure; its intrinsic parallelism is exploited to control, with a centralized architecture, the delegation of promising search subspaces to distributed handling agents. ADJSOLVER has been implemented and tested on a Beowulf platform, using MPI message passing. The communication overhead was minimized by adopting a compact representation of the data exchanged among agents and by reusing previously-computed partial solutions.
Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures / G. Grossi, M. Marchi, E. Pontelli, A. Provetti. - In: JOURNAL OF LOGIC AND COMPUTATION. - ISSN 0955-792X. - 19:4(2009), pp. 697-715.
|Titolo:||Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2009|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1093/logcom/exn036|
|Appare nelle tipologie:||01 - Articolo su periodico|