An And/Or-Parallel implementation of AKL

Montelius, Johan; Ali, Khayri A. M.

doi:10.1007/bf03037217

Cited by 14 publications

(10 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A parallel implementation has also been undertaken by [Moolenaar and Demoen 1993]. A very efficient parallel implementation of AKL has been proposed by Montelius in the Penny system [Montelius 1997;Montelius and Ali 1996]. This implementation combines techniques from or-parallelism and committed choice languages.…”

Section: Fig 30 Execution In Eammentioning

confidence: 99%

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: Fig 30 Execution In Eammentioning

confidence: 99%

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

“…The use of constraints in modeling the behavior of concurrent systems has started with the development of the concurrent constraint (CC) programming framework, where concurrent agents share a store of constraints where they may either post some more constraints (tell operation), to communicate with the other agents, or ask whether some constraint is already present (ask operation), to synchronize with the other agents. We already said in the introduction that some real languages, like Oz [94,177,86,98], AKL [85,108,137], CHR [72], and CIAO [96], have taken up this model and implemented it (although each one differently), thus providing a programming framework for concurrent systems.…”

Section: Constraint Query Languagesmentioning

confidence: 98%

“…In fact, agents can communicate by posting constraints on shared variables, and can synchronize by checking whether a certain constraint has been posted by some other agent. This observation was the main idea underlying the concurrent constraint (CC) programming framework [161], which posed the theoretical foundations for the birth of other concrete languages, like AKL [85,137,108] and Oz [94,177,86,98], which can model reactive and distributed systems via CLPrelated technology.…”

Section: Introduction and Main Conceptsmentioning

confidence: 99%

Constraint (Logic) Programming: A Survey on Research and Applications

Rossi

2000

New Trends in Constraints

View full text Add to dashboard Cite

Abstract. Constraint logic programming (CLP) is a multidisciplinary research area which can be located between Artificial Intelligence, Operation Research, and Programming Languages, and has to do with modeling, solving, and programming real-life problems which can be described as a set of statements (the constraints) which describe some relationship between the problem's variables. This survey paper gives a brief introduction to C(L)P, presents a (necessarily partial) state of the art in CLP research and applications, points out some promising directions for future applications, and discusses how to cope with current research challenges.

show abstract

“…Prolog. A parallel implementation of AKL, called Penny, has been recently completed with good performance results [17,16].…”

Section: Basic and Extendedmentioning

confidence: 99%

Extended dynamic dependent and-parallelism in ACE

Gupta

Pontelli

1997

Proceedings of the Second International Symposium on Parallel Symbolic Computation - PASCO '97

View full text Add to dashboard Cite

We present an extension of Dynamic Dependent Andparallel scheme in which deterministic consumer goals are allowed to bind the dependent variable. The extended scheme leads to: (i) improved efficiency due to pruning of program search space; and, (ii) exploitation of more parallelism due to increased overlapping of dependent executions. In dynamic dependent and-parallel execution, given a parallel conjunction with a shared variable X, the leftmost goal is normally designated as the producer of the binding for X, all others goals are designated as consumers. If the producer goal finishes execution without binding X, then the leftmost consumer goal becomes the next producer and so on. In the extended scheme a deterrninktic consumer goal is also allowed to bind the dependent variable. Our extension leads to incorporation of coroutining in a dynamic dependent and-parallel system. The extended dynamic dependent and-parallel scheme can be regarded as a weak form of the Eztended Andorm Mode!. The implementation of the extended scheme has been realized, based on the Filtered Binding Model for implementing dependent and-parallelism, and has shown excellent results.

show abstract

An And/Or-Parallel implementation of AKL

Cited by 14 publications

References 2 publications

Parallel execution of prolog programs

Parallel execution of prolog programs

Constraint (Logic) Programming: A Survey on Research and Applications

Extended dynamic dependent and-parallelism in ACE

Contact Info

Product

Resources

About