1986
DOI: 10.1007/bf01414554
|View full text |Cite
|
Sign up to set email alerts
|

OR-parallel execution of Prolog on a multi-sequential machine

Abstract: Execution of Prolog Machine on aBased on extending the sequential execution model of Prolog to include parallel execution, we present a method for OR-parallel execution of Prolog on a multiprocessor system. The method reduces the overhead incurred by parallel processing. It allows many processing elements (PEs) to process simultaneously a common branch of a search tree, and each of these PEs creates its local environment and selects a subtree for processing without communication. The run-time overhead is small… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0
2

Year Published

1988
1988
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(15 citation statements)
references
References 3 publications
0
13
0
2
Order By: Relevance
“…4. For instance, the following models employ an environment representation technique that satisfies criteria 1 and 2 above (constant-time task creation and variable access): Versions Vectors Scheme [Hausman et al 1987], Binding Arrays Scheme [Warren 1984;1987c], Argonne-SRI Model [Warren 1987b], Manchester-Argonne Model [Warren 1987b], Delphi Model [Clocksin and Alshawi 1988], Randomized Method [Janakiram et al 1988], BC-Machine [Ali 1988], MUSE [Ali and Karlsson 1990b] (and its variations, such as stack splitting [Gupta and Pontelli 1999c], SBA · 21 [Correia et al 1997], PBA [Gupta et al 1993;), Virtual Memory Binding Arrays model [Véron et al 1993] and, Kabu-Wake Model [Masuzawa et al 1986]; while the following models employs an environment representation technique that satisfies criteria 2 and 3 above (constant-time variable access and task switch): Directory Tree Method [Ciepielewski and Haridi 1983], and Environment Closing Method [Conery 1987a]; and the following models employs an environment representation technique that satisfies criteria 1 and 3 above (constant-time task-creation and task-switch): Hashing Windows Method [Borgwardt 1984], Favored-Bindings Model , and Virtual Memory Hashing Windows model [Véron et al 1993]. Likewise, example of a model that only satisfies criterion 1 (constant time task-creation) is the Time-Stamping Model [Tinker 1988], while the example of a model that only satisfies criterion 3 (constant-time task switching) is the Variable Import Scheme [Lindstrom 1984].…”
Section: Or-parallel Execution Modelsmentioning
confidence: 99%
See 2 more Smart Citations
“…4. For instance, the following models employ an environment representation technique that satisfies criteria 1 and 2 above (constant-time task creation and variable access): Versions Vectors Scheme [Hausman et al 1987], Binding Arrays Scheme [Warren 1984;1987c], Argonne-SRI Model [Warren 1987b], Manchester-Argonne Model [Warren 1987b], Delphi Model [Clocksin and Alshawi 1988], Randomized Method [Janakiram et al 1988], BC-Machine [Ali 1988], MUSE [Ali and Karlsson 1990b] (and its variations, such as stack splitting [Gupta and Pontelli 1999c], SBA · 21 [Correia et al 1997], PBA [Gupta et al 1993;), Virtual Memory Binding Arrays model [Véron et al 1993] and, Kabu-Wake Model [Masuzawa et al 1986]; while the following models employs an environment representation technique that satisfies criteria 2 and 3 above (constant-time variable access and task switch): Directory Tree Method [Ciepielewski and Haridi 1983], and Environment Closing Method [Conery 1987a]; and the following models employs an environment representation technique that satisfies criteria 1 and 3 above (constant-time task-creation and task-switch): Hashing Windows Method [Borgwardt 1984], Favored-Bindings Model , and Virtual Memory Hashing Windows model [Véron et al 1993]. Likewise, example of a model that only satisfies criterion 1 (constant time task-creation) is the Time-Stamping Model [Tinker 1988], while the example of a model that only satisfies criterion 3 (constant-time task switching) is the Variable Import Scheme [Lindstrom 1984].…”
Section: Or-parallel Execution Modelsmentioning
confidence: 99%
“…This model is an evolution of the work on BC-machine by [Ali 1988]-a model where different workers concurrently start the computation of the query and automatically select different alternatives when choice points are created. The idea was already present in the Kabu Wake model [Masuzawa et al 1986].…”
Section: P2mentioning
confidence: 99%
See 1 more Smart Citation
“…A implementação de Muse foi baseada no desenvolvimento de um sistema para paralelismo-OU chamado BC-Machine [2], focado em arquitetura de memória distribuída. A grande contribuição do sistema Muse foi o desenvolvimento do ambiente de cópia incremental, desenvolvido para minimizar o overhead de sincronização, fazendo com que cada instância dentro da mesma ramificação de busca possua uma parte consistente de dados e outra com modificações locais, e a sincronização dos dados é feita copiando apenas a diferença entre o local e global.…”
Section: Museunclassified
“…In this approach, stack frames are explicitly copied from the stack(s) of one processor 1 to that of another whenever the latter processor needs to share a branch of the or-parallel tree of the former. In practice, by having an identical logical address space for tLaboratory for Logic, Datábase, and Advanced Programming, Dept.…”
Section: Introductionmentioning
confidence: 99%