Author(s)
A Scheme for Executing Nested Recursion Parallelism
Computing Science Dept.
Uppsala University
P.O.Box 311, S-751 05
Uppsala, Sweden
Johan.bevermyr@csd.uu.se
Abstract
We propose an extension for nested parallelism in the Reform Prolog
execution model. The proposed modification preserves the simplicity
and efficiency of the original design and its performance model.
This is achieved by exploiting properties of deterministic execution
and careful scheduling of work.