Efficient term size computation for granularity control

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

Descripción

Título: Efficient term size computation for granularity control
Autor/es:
  • Hermenegildo, Manuel V.
  • López García, Pedro
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Twelfth International Conference on Logic Programming
Fechas del Evento: June 13-16, 1995
Lugar del Evento: Tokyo, Japan
Título del Libro: Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming
Fecha: Junio 1995
ISBN: 0262691779
Materias:
Palabras Clave Informales: Granularity analysis and control, Parallelism, Term size computation, Análisis y control de granularidad, Paralelismo, Cálculo de tamaño y plazo.
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

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.

Más información

ID de Registro: 14425
Identificador DC: http://oa.upm.es/14425/
Identificador OAI: oai:oa.upm.es:14425
URL Oficial: http://mitpress.mit.edu/books/logic-programming-0
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 07 Feb 2013 07:29
Ultima Modificación: 21 Abr 2016 14:05
  • 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