Efficient term size computation for granularity control

Hermenegildo, Manuel V. and López García, Pedro (1995). Efficient term size computation for granularity control. In: "Twelfth International Conference on Logic Programming", June 13-16, 1995, Tokyo, Japan. ISBN 0262691779.

Description

Title: Efficient term size computation for granularity control
Author/s:
  • Hermenegildo, Manuel V.
  • López García, Pedro
Item Type: Presentation at Congress or Conference (Article)
Event Title: Twelfth International Conference on Logic Programming
Event Dates: June 13-16, 1995
Event Location: Tokyo, Japan
Title of Book: Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming
Date: June 1995
ISBN: 0262691779
Subjects:
Freetext Keywords: Granularity analysis and control, Parallelism, Term size computation, Análisis y control de granularidad, Paralelismo, Cálculo de tamaño y plazo.
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

Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of optimizations which includes granularity control and recursion elimination. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predeñned) predicates which traverse the terms involved. We propose a technique which has the potential of performing this computation much more efficiently. The technique is based on ñnding program procedures which are called before those in which knowledge regarding term sizes is needed and which traverse the terms whose size is to be determined, and transforming such procedures so that they compute term sizes "on the fly". We present a systematic way of determining whether a given program can be transformed in order to compute a given term size at a given program point without additional term traversal. Also, if several such transformations are possible our approach allows ñnding minimal transformations under certain criteria. We also discuss the advantages and applications of our technique (specifically in the task of granularity control) and present some performance results.

More information

Item ID: 14425
DC Identifier: http://oa.upm.es/14425/
OAI Identifier: oai:oa.upm.es:14425
Official URL: http://mitpress.mit.edu/books/logic-programming-0
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 07 Feb 2013 07:29
Last Modified: 21 Apr 2016 14:05
  • 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