Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism.

Muthukumar, Kalyan; Bueno Carrillo, Francisco; García de la Banda, M. y Hermenegildo, Manuel V. (1999). Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism.. "Journal of logic programming", v. 38 (n. 2); pp. 165-218. ISSN 1567-8326. https://doi.org/10.1016/S0743-1066(98)10022-5.

Descripción

Título: Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism.
Autor/es:
  • Muthukumar, Kalyan
  • Bueno Carrillo, Francisco
  • García de la Banda, M.
  • Hermenegildo, Manuel V.
Tipo de Documento: Artículo
Título de Revista/Publicación: Journal of logic programming
Fecha: Febrero 1999
Volumen: 38
Materias:
Palabras Clave Informales: Automatic parallelization, Parallelizing compilers, Conditional dependency graphs, And-parallelism, &-Prolog, paralelización automática, compiladores paralelizantes, gráficos de dependencia condicional.
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 (3MB) | Vista Previa

Resumen

A framework for the automatic parallelization of (constraint) logic programs is proposed and proved correct. Intuitively, the parallelization process replaces conjunctions of literals with parallel expressions. Such expressions trigger at run-time the exploitation of restricted, goal-level, independent and-parallelism. The parallelization process performs two steps. The first one builds a conditional dependency graph (which can be implified using compile-time analysis information), while the second transforms the resulting graph into linear conditional expressions, the parallel expressions of the &-Prolog language. Several heuristic algorithms for the latter ("annotation") process are proposed and proved correct. Algorithms are also given which determine if there is any loss of parallelism in the linearization process with respect to a proposed notion of maximal parallelism. Finally, a system is presented which implements the proposed approach. The performance of the different annotation algorithms is compared experimentally in this system by studying the time spent in parallelization and the effectiveness of the results in terms of speedups.

Más información

ID de Registro: 14266
Identificador DC: http://oa.upm.es/14266/
Identificador OAI: oai:oa.upm.es:14266
Identificador DOI: 10.1016/S0743-1066(98)10022-5
URL Oficial: http://www.sciencedirect.com/science/article/pii/S0743106698100225
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 15 Ene 2013 10:23
Ultima Modificación: 21 Abr 2016 13:50
  • 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