Comparing Tag Scheme Variations Using an Abstract Machine Generator

Morales Caballero, José Francisco; Carro Liñares, Manuel y Hermenegildo, Manuel V. (2008). Comparing Tag Scheme Variations Using an Abstract Machine Generator. En: "10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2008", 15/07/2008-17/07/2008, Valencia, España. ISBN 978-1-60558-117-0.

Descripción

Título: Comparing Tag Scheme Variations Using an Abstract Machine Generator
Autor/es:
  • Morales Caballero, José Francisco
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2008
Fechas del Evento: 15/07/2008-17/07/2008
Lugar del Evento: Valencia, España
Título del Libro: Proceedings of 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2008
Fecha: 2008
ISBN: 978-1-60558-117-0
Materias:
Palabras Clave Informales: Warren’s abstract machine, Prolog, low-level representation optimization, performance, compilation.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Lenguajes y Sistemas Informáticos e Ingeniería del Software
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 (254kB) | Vista Previa

Resumen

In this paper we study, in the context of a WAM-based abstract machine for Prolog, how variations in the encoding of type information in tagged words and in their associated basic operations impact performance and memory usage. We use a high-level language to specify encodings and the associated operations. An automatic generator constructs both the abstract machine using this encoding and the associated Prolog-to-byte code compiler. Annotations in this language make it possible to impose constraints on the final representation of tagged words, such as the effectively addressable space (fixing, for example, the word size of the target processor /architecture), the layout of the tag and value bits inside the tagged word, and how the basic operations are implemented. We evaluate large number of combinations of the different parameters in two scenarios: a) trying to obtain an optimal general-purpose abstract machine and b) automatically generating a specially-tuned abstract machine for a particular program. We conclude that we are able to automatically generate code featuring all the optimizations present in a hand-written, highly-optimized abstract machine and we canal so obtain emulators with larger addressable space and better performance.

Más información

ID de Registro: 4378
Identificador DC: http://oa.upm.es/4378/
Identificador OAI: oai:oa.upm.es:4378
URL Oficial: http://www.clip.dia.fi.upm.es/Conferences/PPDP08/past.html
Depositado por: Memoria Investigacion
Depositado el: 29 Sep 2010 11:14
Ultima Modificación: 20 Abr 2016 13:38
  • 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