Logic Programming Research
Optimization Schemas for Parallel Implementation
of Nondeterministic Languages and Systems
In Proc. of IEEE Int. Parallel Processing Symposium 1997
IEEE Computer Society, June 1997
Naive parallel implementation of nondeterministic systems (such as a theorem
proving system) and languages (such as a logic, constraint, or a concurrent
constraint language) can result in poor performance.
We present three optimization schemas based on flattening of the
computation tree, procrastination of overheads, and
sequentialization of computations that can be systematically applied to
parallel implementations of non-deterministic systems/languages to reduce the
parallel overhead and to obtain improved efficiency of parallel execution.
The effectiveness of these schemas is illustrated by applying them to the ACE
parallel logic programming
Performance data presented shows that considerable improvement in
performance can result.
The whole paper
can be downloaded from our
Logic Prog. Page Research Page Lab Home Page