Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.

Bueno Carrillo, Francisco; García de la Banda, M. y Hermenegildo, Manuel V. (1995). Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.. Monografía (Informe Técnico). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.
Autor/es:
  • Bueno Carrillo, Francisco
  • García de la Banda, M.
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Informe Técnico)
Fecha: Junio 1995
Materias:
Palabras Clave Informales: (Constraint) Logic programming, Concurrent constraint programming, Compile-time analysis, Abstract interpretation, Independent and-parallelism, Program transformation, Parallelization, Programación lógica restringida, Programación simultánea restringida, análisis del tiempo de compilación, Interpretación abstracta, Transformación de programas, Paralelización.
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 (1MB) | Vista Previa

Resumen

The concept of independence has been recently generalized to the constraint logic programming (CLP) paradigm. Also, several abstract domains specifically designed for CLP languages, and whose information can be used to detect the generalized independence conditions, have been recently defined. As a result we are now in a position where automatic parallelization of CLP programs is feasible. In this paper we study the task of automatically parallelizing CLP programs based on such analyses, by transforming them to explicitly concurrent programs in our parallel CC platform (CIAO) as well as to AKL. We describe the analysis and transformation process, and study its efficiency, accuracy, and effectiveness in program parallelization. The information gathered by the analyzers is evaluated not only in terms of its accuracy, i.e. its ability to determine the actual dependencies among the program variables, but also of its effectiveness, measured in terms of code reduction in the resulting parallelized programs. Given that only a few abstract domains have been already defined for CLP, and that none of them were specifically designed for dependency detection, the aim of the evaluation is not only to asses the effectiveness of the available domains, but also to study what additional information it would be desirable to infer, and what domains would be appropriate for further improving the parallelization process.

Más información

ID de Registro: 15081
Identificador DC: http://oa.upm.es/15081/
Identificador OAI: oai:oa.upm.es:15081
URL Oficial: ftp://clip.dia.fi.upm.es
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 07 May 2013 06:48
Ultima Modificación: 21 Abr 2016 15:10
  • 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