An execution model for exploiting AND-parallelism in logic programs (Q1098621): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:31, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An execution model for exploiting AND-parallelism in logic programs |
scientific article |
Statements
An execution model for exploiting AND-parallelism in logic programs (English)
0 references
1988
0 references
This paper presents a parallel execution model for exploiting AND- parallelism in Horn clause logic programs. The model is based upon the generator-consumer approach, and can be implemented efficiently with small run-time overhead. Other related models that have been proposed to minimize the run-time overhead are unable to exploit the full parallelism inherent in the generator-consumer approach. Furthermore, our model performs backtracking more intelligently than these models. We also present two implementation schemes to realize our model: one has a coordinator to control the activities of processes solving different literals in the same clause; and the other achieves synchronization by letting processes pass messages to each other in a distributed fashion. Trade-offs between these two schemes are then discussed.
0 references
intelligent backtracking
0 references
AND/OR process
0 references
AND-parallelism
0 references
Horn clause
0 references
logic programs
0 references