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

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

Descripción

Título: Towards high-level execution primitives for and-parallelism: preliminary results
Autor/es:
  • Casas, Amadeo
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 7th International Colloquium on Implementation of Constraint and Logic Programming Systems
Fechas del Evento: September 8, 2007
Lugar del Evento: Porto, Portugal
Título del Libro: Proceedings of CICLOPS 2007: 7th International Colloquium on Implementation of Constraint and Logic Programming Systems
Fecha: 2007
Materias:
Palabras Clave Informales: Parallelism, Virtual machines, High-level implementation, Paralelismo, Máquinas virtuales, Aplicación de alto nivel.
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 (971kB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 14601
Identificador DC: http://oa.upm.es/14601/
Identificador OAI: oai:oa.upm.es:14601
URL Oficial: http://www.di.uevora.pt/ciclops07/CICLOPS_2007.html
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 07 Mar 2013 07:31
Ultima Modificación: 21 Abr 2016 14:20
  • 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
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM