Observatorio de I+D+i UPM

Descripción
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.
Internacional	Si
JCR del ISI	No
Título de la revista	International Conference on Logic Programming
ISSN	03029743
Factor de impacto JCR	0
Información de impacto
Volumen	5366/2008
DOI	10.1007/978-3-540-89982-2_53
Número de revista	5366
Desde la página	651
Hasta la página	666
Mes	DICIEMBRE
Ranking

Esta actividad pertenece a memorias de investigación

• Autor: A, Casas (UPM)
• Autor: Manuel de Hermenegildo Salinas (UPM)
• Autor: Manuel Carro Liñares (UPM)

• Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
• Departamento: Inteligencia Artificial
• Departamento: Lenguajes y Sistemas Informáticos e Ingeniería de Software