Title: Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
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.
Publication Year: 2008
Publication Date: 2008-08-05
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot