On the sequential nature of unification
Journal of Logic Programming
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
A comparative study of unification algorithms for or-parallel execution of logic languages
IEEE Transactions on Computers
Performance studies of a parallel Prolog architecture
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
A distributed prolog system with AND-parallelism
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Functional Programming
A Parallel Execution Model for Prolog
A Parallel Execution Model for Prolog
A High Performance Architecture for Prolog
A High Performance Architecture for Prolog
The Berkeley PLM Instruction Set: An Instruction Set for Prolog
The Berkeley PLM Instruction Set: An Instruction Set for Prolog
An Abstract Machine Based Execution Model for Computer Architecture DesignAnd Efficient Implementation of Logic Programs in Parallel
Parallel unification scheduling in prolog
Parallel unification scheduling in prolog
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Parallel programming with logic languages: A survey
Computer Languages
| Hi-index | 14.98 |
Performance results are presented for a parallel execution model for Prolog that supports AND-parallelism, OR-parallelism, and intelligent backtracking. The results show that restricted AND-parallelism is of limited benefit for small programs, but produced speedups from 7-10 on two large programs. OR-parallelism was found to be generally not useful for the benchmarks examined if the semantics of Prolog were preserved. Of particular interest is the phenomenon of super-multiplicative behavior, in which the performance improvement obtained when more than one technique is used is greater than the product of the performance improvements due to each technique individually. The implications of the performance results for parallel Prolog systems are discussed, and directions for future work are indicated.