An Abstract Machine for the Reduce or Process Model for Parallel Prolog

We discuss the design of an abstract machine for the Reduce-OR process model (ROPM) for the AND and OR parallel execution of Prolog programs. It differs from the WAM in many respects, and some of these differences are elaborates upon in this paper. Some of the significant differences are related to the binding environment which has been designed to support AND and OR parallel execution of logic programs on both shared and non shared memory machines, the process model, and the handling of solution for AND parallel branches in the Data Join Graph (DJG) that is used to represent data dependencies in a Prolog cause. An emulator for the abstract machine has been implemented and is targeted for both shared and nonshared memory machines.

B. Ramkumar and L. V. Kale, "An Abstract Machine  for  the Reduce or Process 
Model for Parallel Prolog", Proceedings of Knowledge Based Computer Systems 
Conference, Bombay, India, December 1989, pp. 267-276.

@INPROCEEDINGS{AbsMachParPrologPKBCSC89,
        author = "B. Ramkumar and L. V. Kal{\'e}",
        title = "An Abstract Machine  for  the Reduce 
            or Process Model for Parallel {P}rolog",
        booktitle =  "Proceedings of Knowledge Based Computer Systems Conference",
        address = "Bombay, India", 
        month = "December", 
        year = "1989", 
        pages = "267-276",
        annote = "89-9",
        group = Y,
}