Towards high-level execution primitives for and-parallelism: preliminary results

Casas, Amadeo and Carro Liñares, Manuel and Hermenegildo, Manuel V. (2007). Towards high-level execution primitives for and-parallelism: preliminary results. In: "7th International Colloquium on Implementation of Constraint and Logic Programming Systems", September 8, 2007, Porto, Portugal.

Description

Title: Towards high-level execution primitives for and-parallelism: preliminary results
Author/s:
  • Casas, Amadeo
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 7th International Colloquium on Implementation of Constraint and Logic Programming Systems
Event Dates: September 8, 2007
Event Location: Porto, Portugal
Title of Book: Proceedings of CICLOPS 2007: 7th International Colloquium on Implementation of Constraint and Logic Programming Systems
Date: 2007
Subjects:
Freetext Keywords: Parallelism, Virtual machines, High-level implementation, Paralelismo, Máquinas virtuales, Aplicación de alto nivel.
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 (971kB) | Preview

Abstract

Most implementations of parallel logic programming rely on complex low-level machinery which is arguably difflcult to implement and modify. We explore an alternative approach aimed at taming that complexity by raising core parts of the implementation to the source language level for the particular case of and-parallelism. Therefore, we handle a signiflcant portion of the parallel implementation mechanism at the Prolog level with the help of a comparatively small number of concurrency-related primitives which take care of lower-level tasks such as locking, thread management, stack set management, etc. The approach does not eliminate altogether modiflcations to the abstract machine, but it does greatly simplify them and it also facilitates experimenting with different alternatives. We show how this approach allows implementing both restricted and unrestricted (i.e., non fork-join) parallelism. Preliminary experiments show that the amount of performance sacriflced is reasonable, although granularity control is required in some cases. Also, we observe that the availability of unrestricted parallelism contributes to better observed speedups.

More information

Item ID: 14601
DC Identifier: http://oa.upm.es/14601/
OAI Identifier: oai:oa.upm.es:14601
Official URL: http://www.di.uevora.pt/ciclops07/CICLOPS_2007.html
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 07 Mar 2013 07:31
Last Modified: 21 Apr 2016 14:20
  • 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