Extracting non-strict independent and-parallelism using sharing and freeness information

Cabeza Gras, Daniel y Hermenegildo, Manuel V. (1994). Extracting non-strict independent and-parallelism using sharing and freeness information. En: "1994 International Static Analysis Symposium", September 28-30, 1994, Namur (Belgium). ISBN 3540584854.

Descripción

Título: Extracting non-strict independent and-parallelism using sharing and freeness information
Autor/es:
  • Cabeza Gras, Daniel
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 1994 International Static Analysis Symposium
Fechas del Evento: September 28-30, 1994
Lugar del Evento: Namur (Belgium)
Título del Libro: Static Analysis: First International Static Analysis Symposium
Fecha: 1994
ISBN: 3540584854
Volumen: 864
Materias:
Palabras Clave Informales: Parallel execution of logic programs, Compilation techniques, Generation of annotations for parallelism, Abstract interpretation, Non-strict independent and-parallelism, Técnicas de compilación, Generación de anotaciones para paralelismos, Ejecución paralela de programación lógica, Interprateción de resúmenes.
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

Logic programming systems which exploit and-parallelism among non-deterministic goals rely on notions of independence among those goals in order to ensure certain efficiency properties. "Non-strict" independence (NSI) is a more relaxed notion than the traditional notion of "strict" independence (SI) which still ensures the relevant efficiency properties and can allow considerable more parallelism than SI. However, all compilation technology developed to date has been based on SI, because of the intrinsic complexity of exploiting NSI. This is related to the fact that NSI cannot be determined "a priori" as SI. This paper filis this gap by developing a technique for compile-time detection and annotation of NSI. It also proposes algorithms for combined compiletime/ run-time detection, presenting novel run-time checks for this type of parallelism. Also, a transformation procedure to eliminate shared variables among parallel goals is presented, aimed at performing as much work as possible at compile-time. The approach is based on the knowledge of certain properties regarding the run-time instantiations of program variables —sharing and freeness— for which compile-time technology is available, with new approaches being currently proposed. Thus, the paper does not deal with the analysis itself, but rather with how the analysis results can be used to parallelize programs.

Más información

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