The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

Muthukumar, Kalyan y Hermenegildo, Manuel V. (1990). The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism. En: "Seventh International Conference of Logic Programming", June 18-20, 1990, Jerusalem, Israel. ISBN 0262730901.

Descripción

Título: The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism
Autor/es:
  • Muthukumar, Kalyan
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Seventh International Conference of Logic Programming
Fechas del Evento: June 18-20, 1990
Lugar del Evento: Jerusalem, Israel
Título del Libro: Logic Programming, Proceedings of the Seventh International Conference
Fecha: Junio 1990
ISBN: 0262730901
Materias:
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 (807kB) | Vista Previa

Resumen

There has been significant interest in parallel execution models for logic programs which exploit Independent And-Parallelism (IAP). In these models, it is necessary to determine which goals are independent and therefore eligible for parallel execution and which goals have to wait for which others during execution. Although this can be done at run-time, it can imply a very heavy overhead. In this paper, we present three algorithms for automatic compiletime parallelization of logic programs using IAP. This is done by converting a clause into a graph-based computational form and then transforming this graph into linear expressions based on &-Prolog, a language for IAP. We also present an algorithm which, given a clause, determines if there is any loss of parallelism due to linearization, for the case in which only unconditional parallelism is desired. Finally, the performance of these annotation algorithms is discussed for some benchmark programs.

Más información

ID de Registro: 14493
Identificador DC: http://oa.upm.es/14493/
Identificador OAI: oai:oa.upm.es:14493
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 15 Feb 2013 07:50
Ultima Modificación: 21 Abr 2016 14:11
  • 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