Annotation algorithms for unrestricted independent and-parallelism in logic programs

Casas, Amadeo and Carro Liñares, Manuel and Hermenegildo, Manuel V. (2008). Annotation algorithms for unrestricted independent and-parallelism in logic programs. In: "17th International Symposium, LOPSTR 2007", August 23-24, 2007, Kongens Lyngby, Denmark. ISBN 978-3-540-78768-6.

Description

Title: Annotation algorithms for unrestricted independent and-parallelism in logic programs
Author/s:
  • Casas, Amadeo
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 17th International Symposium, LOPSTR 2007
Event Dates: August 23-24, 2007
Event Location: Kongens Lyngby, Denmark
Title of Book: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Date: 2008
ISBN: 978-3-540-78768-6
Volume: 4915
Subjects:
Freetext Keywords: Logic programming, Automatic parallelization, And-parallelism, Program transformation, Programación lógica, Paralelización automática.
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 (863kB) | Preview

Abstract

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to genérate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

More information

Item ID: 14322
DC Identifier: http://oa.upm.es/14322/
OAI Identifier: oai:oa.upm.es:14322
Official URL: http://link.springer.com/chapter/10.1007%2F978-3-540-78769-3_10?LI=true
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 19 Jan 2013 13:32
Last Modified: 21 Apr 2016 13:56
  • 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