Parallel algorithms for controlling the execution of Prolog programs on tree machines are proposed, and their efficiences are compared through simulation experiments. The model of the tree machine used in this experiment consists of a single-tree engine, a multiplexer, and a system controller. The single-tree engine is a common part of tree machines and has generality. From the simulation results it appears that if the given problem has enough parallelism, then high performance can be obtained by the algorithms proposed. While a better utilization of processing elements and a better load balancing remain problems, tree machines are found to be suitable for parallel implementation of Prolog.
|Title of host publication||Unknown Host Publication Title|
|Editors||Harold S. Stone|
|Number of pages||10|
|Publication status||Published - Dec 1 1986|
All Science Journal Classification (ASJC) codes