An abstract machine for the reduce-OR process model for parallel prolog

Balkrishna Ramkumar, Laxmikant V. Kalé

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 elaborated 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 nonshared memory machines, the process model, and the handling of solutions for AND parallel branches in the Data Join Graph (DJG 1) that is used to represent data dependencies in a Prolog clause. An emulator for the abstract machine has been implemented and is targeted for both shared and nonshared memory machines.

Original languageEnglish (US)
Title of host publicationKnowledge Based Computer Systems - International Conference KBCS 1989, Proceedings
EditorsS. Ramani, R. Chandrasekar, K.S.R. Anjaneyulu
PublisherSpringer
Pages266-275
Number of pages10
ISBN (Print)9783540528500
DOIs
StatePublished - 1990
Event2nd International Conference on Knowledge Based Computer Systems, KBCS 1989 - Bombay, India
Duration: Dec 11 1989Dec 13 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume444 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Knowledge Based Computer Systems, KBCS 1989
Country/TerritoryIndia
CityBombay
Period12/11/8912/13/89

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An abstract machine for the reduce-OR process model for parallel prolog'. Together they form a unique fingerprint.

Cite this