Towards extracting non-strict independent and-parallelism using sharing and freeness information

Cabeza Gras, Daniel y Hermenegildo, Manuel V. (1993). Towards extracting non-strict independent and-parallelism using sharing and freeness information. Monografía (Informe Técnico). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: Towards extracting non-strict independent and-parallelism using sharing and freeness information
Autor/es:
  • Cabeza Gras, Daniel
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Informe Técnico)
Fecha: Abril 1993
Materias:
Palabras Clave Informales: Parallel execution of logic programs, Generation of annotations for parallelism, Abstract interpretation, Non-strictly independent and-parallelism, Ejecución paralela de programación lógica, Generación de notas para paralelismos, Interpretación abstracta.
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, presumably 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 fills this gap by developing a technique for compile-time detection and annotation of NSI. It also proposes algorithms for combined compile- time/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, attempting to perform as much work as possible at compiletime. The approach is based on the knowledge of certain properties about run-time instantiations of program variables —sharing and freeness— for which compile-time technology is available, with new approaches being currently proposed.

Más información

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