DocumentCode :
1293606
Title :
A comparative study of unification algorithms for OR-parallel execution of logic languages
Author :
Crammond, Jim
Author_Institution :
Dept. of Appl. Math., Weizmann Inst., Rehovoth, Israel
Issue :
10
fYear :
1985
Firstpage :
911
Lastpage :
917
Abstract :
As a step toward designing a computer architecture suitable for executing parallel logic languages, the author has studied some memory management techniques proposed for creating multiple binding environments, which are required with OR-parallelism. Three algorithms have been implemented using a Prolog-like interpreter and have been tried on some logic programs, to attempt to compare their relative performance. The author describes these algorithms and their implementation and discusses the results of the performance analysis. The attempts compare the algorithms, although accurate comparisons are difficult to make since some aspects of the algorithms are architecture-dependent.
Keywords :
computer architecture; file organisation; logic programming; program interpreters; OR-parallel execution; Prolog-like interpreter; computer architecture; logic languages; logic programs; memory management techniques; multiple binding environments; performance analysis; unification algorithms; Algorithm design and analysis; Indexes; Memory management; Parallel processing; Reactive power; Vectors; Logic programming; OR-parallelism; memory management; performance evaluation;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1985.6312194
Filename :
6312194
Link To Document :
بازگشت