In this thesis, an abstract machine for the goal process model is designed. The goal process model which is a parallel execution model of logic program supports both Restricted AND Parallelism (RAP) and Pipelined OR parallelism.
The designed abstract machine, called X-WAM, is an extended form of the Warren Abstract Machine (WAM) which is a sequential abstract machine for Prolog, to multiprocessor system. In design, to solve the binding conflict problem caused by OR Parallelism, the copying mechanism of binding environments is used. In addition, not only data structures such as goal stack, solution list and slot pack but also abstract instruction set are proposed to support both RAP and Pipelined OR Parallelism. The performance of the goal process model is also analyzed by simulation.
