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

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

Description

Title: Extracting non-strict independent and-parallelism using sharing and freeness information
Author/s:
  • Cabeza Gras, Daniel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 1994 International Static Analysis Symposium
Event Dates: September 28-30, 1994
Event Location: Namur (Belgium)
Title of Book: Static Analysis: First International Static Analysis Symposium
Date: 1994
ISBN: 3540584854
Volume: 864
Subjects:
Freetext Keywords: 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.
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

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.

More information

Item ID: 14440
DC Identifier: http://oa.upm.es/14440/
OAI Identifier: oai:oa.upm.es:14440
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 09 Feb 2013 09:36
Last Modified: 21 Apr 2016 14:06
  • 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