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

Bueno Carrillo, Francisco and García de la Banda, M. and Hermenegildo, Manuel V. (1995). Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.. Monografía (Technical Report). Facultad de Informática (UPM), Madrid, Spain.

Description

Title: Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.
Author/s:
  • Bueno Carrillo, Francisco
  • García de la Banda, M.
  • Hermenegildo, Manuel V.
Item Type: Monograph (Technical Report)
Date: June 1995
Subjects:
Freetext Keywords: (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.
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 (1MB) | Preview

Abstract

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.

More information

Item ID: 15081
DC Identifier: http://oa.upm.es/15081/
OAI Identifier: oai:oa.upm.es:15081
Official URL: ftp://clip.dia.fi.upm.es
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 07 May 2013 06:48
Last Modified: 21 Apr 2016 15:10
  • 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