Complete and efficient methods for supporting side effects in independent/restricted and-parallelism

Muthukumar, Kalyan and Hermenegildo, Manuel V. (1989). Complete and efficient methods for supporting side effects in independent/restricted and-parallelism. In: "ICLP 1989 International Conference on Logic Programming", June 19-23, 1989, Lisbon, Portugal. ISBN 0262620650.

Description

Title: Complete and efficient methods for supporting side effects in independent/restricted and-parallelism
Author/s:
  • Muthukumar, Kalyan
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: ICLP 1989 International Conference on Logic Programming
Event Dates: June 19-23, 1989
Event Location: Lisbon, Portugal
Title of Book: Logic Programming, Proceedings of the Sixth International Conference
Date: June 1989
ISBN: 0262620650
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (789kB) | Preview

Abstract

It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of such programs. In particular, it is possible to parallelize pure Prolog programs while maintaining the semantics of the language. However, when builtin side-effects (such as write or assert) appear in the program, if an identical observable behaviour to that of sequential Prolog implementations is to be preserved, such side-effects have to be properly sequenced. Previously proposed solutions to this problem are either incomplete (lacking, for example, backtracking semantics) or they force sequentialization of significant portions of the execution graph which could otherwise run in parallel. In this paper a series of side-effect synchronization methods are proposed which incur lower overhead and allow more parallelism than those previously proposed. Most importantly, and unlike previous proposals, they have well-defined backward execution behaviour and require only a small modification to a given (And-parallel) Prolog implementation.

More information

Item ID: 14525
DC Identifier: http://oa.upm.es/14525/
OAI Identifier: oai:oa.upm.es:14525
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 21 Feb 2013 09:01
Last Modified: 21 Apr 2016 14:14
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM