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. [10.1093/logcom/exn036]
Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
G. Grossi;A. Provetti
2009
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
JLC_697.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
279.21 kB
Formato
Adobe PDF
|
279.21 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
