Lee Yong Doo, Kim Hie Cheol, Chae Soo Hoan

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 7, pp. 1719-1726, Dec. 1996
10.3745/KIPSTE.1996.3.7.1719,   PDF Download:

Abstract

In the OR-parallel execution of logic programs, binding environments have a critical impact on the performance. Particularly, this is true for distributed execution on parallel systems with a non-single address space. The reason is that in such systems, the remote accesses across processing elements deteriorate the performance. To solve this problem, some binding methods were previously proposed specifically for a non-single address space. However, compared with the binding methods for a single address space, they are far less efficient due to the overhead of newly introduced operations such as environment closing and back-unification. In this paper, we propose a new binding method geared particularly toward architectures with a non-single address space. The proposed binding environment is a hybrid that combines both the binding methods for a single address space and those for a non-single address space. It acomplishes high efficiency by making closing operations unnecessary both at unification and at back-unification, while maintaing the restricted access.

Statistics
Cite this article