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

Hermenegildo, Manuel V. y 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.

Descripción

Título: A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
Autor/es:
  • Hermenegildo, Manuel V.
  • Carro Liñares, Manuel
Tipo de Documento: Artículo
Título de Revista/Publicación: Lecture Notes in Computer Science
Fecha: Diciembre 2008
Volumen: 5366
Materias:
Palabras Clave Informales: And-Parallelism, High-level Implementation, Prolog
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (475kB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 2903
Identificador DC: http://oa.upm.es/2903/
Identificador OAI: oai:oa.upm.es:2903
Identificador DOI: 10.1007/978-3-540-89982-2_53
URL Oficial: http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0
Depositado por: Memoria Investigacion
Depositado el: 26 Abr 2010 09:32
Ultima Modificación: 20 Abr 2016 12:31
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM