Parallel implementation of logic programs
Due to implicit representation of parallelism and separation of specification and control, logic programming also offers a possible solution to the problem of utilizing highly parallel architectures. Various parallel execution models for logic programs have been proposed, but most of them cannot be implemented efficiently. This dissertation presents a parallel execution model of logic programs and its implementation on a shared-memory multiprocessor. The execution model preserves the don't know nondeterminism, and follows the generator-consumer approach to exploit AND-parallelism. Unlike many other execution models, this model constructs the data-dependency information dynamically, requires no information from the user, and is able to exploit all the AND-parallelism available in the framework of the generator-consumer approach. Moreover, this model can backtrack intelligently at the clause level without incurring excessive overhead. Implementation of this execution model on Sequent Balance multiprocessor obtains linear speedup on many programs containing AND-parallelism.
- Research Organization:
- Texas Univ., Austin, TX (USA)
- OSTI ID:
- 5575570
- Country of Publication:
- United States
- Language:
- English
Similar Records
Abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel
Performance of an OR-parallel logic programming system