Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures

摘要

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.