Full prolog and scheduling or-parallelism in muse

Ali, Khayri A. M.; Karlsson, Roland

doi:10.1007/bf01397627

Cited by 44 publications

(40 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two prominent or-parallel systems that have been built, namely MUSE and Aurora, do support sequential Prolog semantics by executing an extralogical predicates only when the branch containing it becomes the leftmost in the search tree. Different techniques have been proposed to detect when a branch of the or-parallel tree becomes the leftmost active branch in the tree [Ali and Karlsson 1990a;Sindaha 1993]. Arguably, the techniques used in Aurora have been the most well researched and successful [Hausman et al 1988;Hausman 1989].…”

Section: Support For Full Prolog In Or-parallelismmentioning

confidence: 99%

“…The MUSE or-parallel Prolog system has been designed and implemented on a number of UMA and NUMA computers (Sequent Symmetry, Sun Galaxy, BBN Butterfly II, etc.) [Ali and Karlsson 1990b;1990a;Ali et al 1992;Ali and Karlsson 1992b;Karlsson 1992]. It supports the full Prolog language and programs run on it with almost no user annotations.…”

Section: 52mentioning

confidence: 99%

“…In the Stack-copying method [Ali and Karlsson 1990b;1990a] a separate environment is maintained by each worker in which it can write without causing any binding conflicts. In Stack-copying even unconditional bindings are not shared, as they are in the other methods described above.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, Andparallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

show abstract

Section: Support For Full Prolog In Or-parallelismmentioning

confidence: 99%

Section: 52mentioning

confidence: 99%

See 1 more Smart Citation

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

show abstract

“…Definition 9 and Example 2. Or-parallelism has successfully been exploited in Prolog in the Aurora [20] and the Muse [1] systems both of which have shown very good speed-up results over a considerable range of applications.…”

Section: Coalgebraic Semantics and Parallel Execution Of Logic Programsmentioning

confidence: 99%

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Komendantskaya

McCusker

Power

2011

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

Abstract. Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either P f P f -coalgebras or P f Listcoalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.

show abstract

“…In this approach, provided there is a mechanism for copying stacks, the only cells that need to be shared during execution are those corresponding to the choice points. Shared choice points are thus copied from P2's private memory to shared memory where they can be accessed from both Pl's and P2's private memory via pointers 3 (these choice points are said to have been made public, following MUSE's terminology).…”

Section: The Stack Copying Approach Tomentioning

confidence: 99%

ACE: And/or-parallel copying-based execution of logic programs

Gupta

Hermenegildo

1991

Parallel Execution of Logic Programs

View full text Add to dashboard Cite

In this paper we present a novel execution model for parallel implementation of logic programs which is capable of exploiting both independent and-parallelism and or-parallelism in an efficient way. This model extends the stack copying approach, which has been successfully applied in the Muse system to implement or-parallelism, by integrating it with proven techniques used to support independent and-parallelism. We show how all solutions to non-deterministic andparallel goals are found without repetitions. This is done through recomputation as in Prolog (and in various and-parallel systems, like &-Prolog and DDAS), i.e., solutions of and-parallel goals are not shared. We propose a scheme for the efficient management of the address space in a way that is compatible with the apparently incompatible requirements of both and-and or-parallelism. We also show how the full Prolog language, with all its extra-logical features, can be supported in our and-or parallel system so that its sequential semantics is preserved. The resulting system retains the advantages of both purely or-parallel systems as well as purely and-parallel systems. The stack copying scheme together with our proposed memory management scheme can also be used to implement models that combine dependent and-parallelism and or-parallelism, such as Andorra and Prometheus.

show abstract

Full prolog and scheduling or-parallelism in muse

Cited by 44 publications

References 6 publications

Parallel execution of prolog programs

Parallel execution of prolog programs

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

ACE: And/or-parallel copying-based execution of logic programs

Contact Info

Product

Resources

About