This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
As a step towards designing a computer architecture suitable for executing parallel logic languages, we have 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. This paper describes these algorithms and their implementation and discusses the results of the performance analysis. We attempt to make some comparisons between the algorithms, although accurate comparisons are difficult to make since some aspects of the algorithms are architecture dependent.
Index Terms:
performance evaluation,Logic programming,memory management,OR-parallelism
Citation:
"A comparative study of unification algorithms for OR-parallel execution of logic languages," IEEE Transactions on Computers, vol. 34, no. 10, pp. 911-917, Oct. 1985, doi:10.1109/TC.1985.6312194
Usage of this product signifies your acceptance of the Terms of Use.