Thread-Based Competitive Or-Parallelism

Authors:
Paulo Moura;Ricardo Rocha;Sara C. Madeira
Affiliations:
Dep. of Computer Science, University of Beira Interior, Portugal and Center for Research in Advanced Computing Systems, INESC---Porto, Portugal;Dep. of Computer Science, University of Porto, Portugal and Center for Research in Advanced Computing Systems, INESC---Porto, Portugal;Dep. of Computer Science, University of Beira Interior, Portugal and Knowledge Discovery and Bioinformatics Group, INESC---ID, Portugal
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 3
Cited 0

The family of concurrent logic programming languages

ACM Computing Surveys (CSUR)
The muse approach to Or-parallel Prolog

International Journal of Parallel Programming
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the logic programming concept of thread-based competitive or-parallelism , which combines the original idea of competitive or-parallelism with committed-choice nondeterminism and speculative threading. In thread-based competitive or-parallelism, an explicit disjunction of subgoals is interpreted as a set of concurrent alternatives, each running in its own thread. The subgoals compete for providing an answer and the first successful subgoal leads to the termination of the remaining ones. We discuss the implementation of competitive or-parallelism in the context of Logtalk, an object-oriented logic programming language, and present experimental results.