1991
DOI: 10.1016/0167-739x(91)90006-j
|View full text |Cite
|
Sign up to set email alerts
|

DIALOG — A dataflow model for parallel execution of logic programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1993
1993
1993
1993

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Several approaches have been proposed to exploit OR parallelism in Prolog programs. The most significant are: the process tree models [4], where each node in the search tree is associated with a process which tries to solve it, data flow models [5,10], where the search tree is represented as a set of processes synchronized by the.data flow, and multisequential models [8,9,6,1,2]. The latter are based on having multiple Prolog engines that work like sequential ones combined with a method to keep the multiple variable bindings that different Prolog engines could achieve, and with a method to share the work between the system workers 1.…”
Section: Introductionmentioning
confidence: 99%
“…Several approaches have been proposed to exploit OR parallelism in Prolog programs. The most significant are: the process tree models [4], where each node in the search tree is associated with a process which tries to solve it, data flow models [5,10], where the search tree is represented as a set of processes synchronized by the.data flow, and multisequential models [8,9,6,1,2]. The latter are based on having multiple Prolog engines that work like sequential ones combined with a method to keep the multiple variable bindings that different Prolog engines could achieve, and with a method to share the work between the system workers 1.…”
Section: Introductionmentioning
confidence: 99%