A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

Hermenegildo, Manuel V. and Carro Liñares, Manuel (2008). A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism. "Lecture Notes in Computer Science", v. 5366 ; pp. 651-666. ISSN 0302-9743. https://doi.org/10.1007/978-3-540-89982-2_53.

Description

Title: A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
Author/s:
  • Hermenegildo, Manuel V.
  • Carro Liñares, Manuel
Item Type: Article
Título de Revista/Publicación: Lecture Notes in Computer Science
Date: December 2008
ISSN: 0302-9743
Volume: 5366
Subjects:
Freetext Keywords: And-Parallelism, High-level Implementation, Prolog
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 (475kB) | Preview

Abstract

The growing popularity of multicore architectures has renewed interest in language-based approaches to the exploitation of parallelism. Logic programming has proved an interesting framework to this end, and there are parallel implementations which have achieved significant speedups, but at the cost of a quite sophisticated low-level machinery. This machinery has been found challenging to code and, specially, to maintain and expand. In this paper, we follow a different approach which adopts a higher level view by raising some of the core components of the implementation to the level of the source language. We briefly present an implementation model for independent and-parallelism which fully supports non-determinism through backtracking and provides flexible solutions for some of the main problems found in previous and-parallel implementations. Our proposal is able to optimize the execution for the case of deterministic programs and to exploit unrestricted and-parallelism, which allows exposing more parallelism among clause literals than fork-join-based proposals. We present performance results for an implementation, including data for benchmarks where and-parallelism is exploited in non-deterministic programs.

More information

Item ID: 2903
DC Identifier: http://oa.upm.es/2903/
OAI Identifier: oai:oa.upm.es:2903
DOI: 10.1007/978-3-540-89982-2_53
Official URL: http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0
Deposited by: Memoria Investigacion
Deposited on: 26 Apr 2010 09:32
Last Modified: 20 Apr 2016 12:31
  • 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