An execution model for exploiting AND-parallelism in logic programs |
| |
Authors: | Yow-Jian Lin Vipin Kumar |
| |
Affiliation: | 1. Artificial Intelligence Laboratory, Department of Computer Sciences, The University of Texas at Austin, 78712, Austin, Texas, USA
|
| |
Abstract: | 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.
This work was supported by Army Research Office grant #DAAG29-84-K-0060 to the Artificial Intelligence Laboratory at the University
of Texas at Austin. |
| |
Keywords: | AND-Parallelism Intelligent Backtracking AND/OR Process Model Logic Programs |
本文献已被 SpringerLink 等数据库收录! |
|