OR parallel execution of Prolog programs with side effects

Research output: Contribution to journalArticle

Abstract

With the growing availability of multiprocessors, a great deal of attention has been given to executing Prolog in parallel. A question that naturally arises is how to execute standard sequential Prolog programs with side effects in parallel. The problem of performing side effects in AND parallel systems has been considered elsewhere. This paper presents a method that generates sequential semantics of side effect predicates in an OR parallel system. First, a general method is given for performing data side effects such as read and write. This method is then extended to control side effects such as asserta, assertz, and retract. Finally, a constant-time algorithm for performing cut is presented.

Original languageEnglish (US)
Pages (from-to)209-223
Number of pages15
JournalThe Journal of Supercomputing
Volume2
Issue number2
DOIs
StatePublished - Oct 1 1988

Fingerprint

Prolog
Semantics
Availability
Parallel Systems
Retract
Time Constant
Multiprocessor
Predicate

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture

Cite this

OR parallel execution of Prolog programs with side effects. / Kale, Laxmikant V.; Padua, David A.; Sehr, David C.

In: The Journal of Supercomputing, Vol. 2, No. 2, 01.10.1988, p. 209-223.

Research output: Contribution to journalArticle

@article{30f365a55d7241cbb4869ca7fd4b88fc,
title = "OR parallel execution of Prolog programs with side effects",
abstract = "With the growing availability of multiprocessors, a great deal of attention has been given to executing Prolog in parallel. A question that naturally arises is how to execute standard sequential Prolog programs with side effects in parallel. The problem of performing side effects in AND parallel systems has been considered elsewhere. This paper presents a method that generates sequential semantics of side effect predicates in an OR parallel system. First, a general method is given for performing data side effects such as read and write. This method is then extended to control side effects such as asserta, assertz, and retract. Finally, a constant-time algorithm for performing cut is presented.",
author = "Kale, {Laxmikant V.} and Padua, {David A.} and Sehr, {David C.}",
year = "1988",
month = "10",
day = "1",
doi = "10.1007/BF00128177",
language = "English (US)",
volume = "2",
pages = "209--223",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - OR parallel execution of Prolog programs with side effects

AU - Kale, Laxmikant V.

AU - Padua, David A.

AU - Sehr, David C.

PY - 1988/10/1

Y1 - 1988/10/1

N2 - With the growing availability of multiprocessors, a great deal of attention has been given to executing Prolog in parallel. A question that naturally arises is how to execute standard sequential Prolog programs with side effects in parallel. The problem of performing side effects in AND parallel systems has been considered elsewhere. This paper presents a method that generates sequential semantics of side effect predicates in an OR parallel system. First, a general method is given for performing data side effects such as read and write. This method is then extended to control side effects such as asserta, assertz, and retract. Finally, a constant-time algorithm for performing cut is presented.

AB - With the growing availability of multiprocessors, a great deal of attention has been given to executing Prolog in parallel. A question that naturally arises is how to execute standard sequential Prolog programs with side effects in parallel. The problem of performing side effects in AND parallel systems has been considered elsewhere. This paper presents a method that generates sequential semantics of side effect predicates in an OR parallel system. First, a general method is given for performing data side effects such as read and write. This method is then extended to control side effects such as asserta, assertz, and retract. Finally, a constant-time algorithm for performing cut is presented.

UR - http://www.scopus.com/inward/record.url?scp=0002245307&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002245307&partnerID=8YFLogxK

U2 - 10.1007/BF00128177

DO - 10.1007/BF00128177

M3 - Article

AN - SCOPUS:0002245307

VL - 2

SP - 209

EP - 223

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 2

ER -