The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

Muthukumar, Kalyan and Hermenegildo, Manuel V. (1990). The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism. In: "Seventh International Conference of Logic Programming", June 18-20, 1990, Jerusalem, Israel. ISBN 0262730901.

Description

Title: The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism
Author/s:
  • Muthukumar, Kalyan
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: Seventh International Conference of Logic Programming
Event Dates: June 18-20, 1990
Event Location: Jerusalem, Israel
Title of Book: Logic Programming, Proceedings of the Seventh International Conference
Date: June 1990
ISBN: 0262730901
Subjects:
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 (807kB) | Preview

Abstract

There has been significant interest in parallel execution models for logic programs which exploit Independent And-Parallelism (IAP). In these models, it is necessary to determine which goals are independent and therefore eligible for parallel execution and which goals have to wait for which others during execution. Although this can be done at run-time, it can imply a very heavy overhead. In this paper, we present three algorithms for automatic compiletime parallelization of logic programs using IAP. This is done by converting a clause into a graph-based computational form and then transforming this graph into linear expressions based on &-Prolog, a language for IAP. We also present an algorithm which, given a clause, determines if there is any loss of parallelism due to linearization, for the case in which only unconditional parallelism is desired. Finally, the performance of these annotation algorithms is discussed for some benchmark programs.

More information

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