Towards execution time estimation in abstract machine-based languages

Mera, E.; López García, Pedro; Carro Liñares, Manuel y Hermenegildo, Manuel V. (2008). Towards execution time estimation in abstract machine-based languages. En: "10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming", 15-17 July, 2008, Valencia, Spain. ISBN 978-1-60558-117-0.

Descripción

Título: Towards execution time estimation in abstract machine-based languages
Autor/es:
  • Mera, E.
  • López García, Pedro
  • 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
Fechas del Evento: 15-17 July, 2008
Lugar del Evento: Valencia, Spain
Título del Libro: PPDP '08 Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Fecha: 2008
ISBN: 978-1-60558-117-0
Materias:
Palabras Clave Informales: Execution time estimation, Cost analysis, Profiling, Resource awareness, Cost models, Logic programming, Estimación del tiempo de ejecución, Análisis del coste, Elaboración de perfiles, Modelos de coste, Programación lógica.
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

Abstract machines provide a certain separation between platformdependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the speciflc abstract machine implementation and the bytecode is left largely architecture independent. Taking advantage of this fact, we present a framework for estimating upper and lower bounds on the execution times of logic programs running on a bytecode-based abstract machine. Our approach includes a one-time, programindependent proflling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compile-time cost estimation phase, using the instruction timing information, infers expressions giving platform-dependent upper and lower bounds on actual execution time as functions of input data sizes for each program. Working at the abstract machine level makes it possible to take into account low-level issues in new architectures and platforms by just reexecuting the calibration stage instead of having to tailor the analysis for each architecture and platform. Applications of such predicted execution times include debugging/veriflcation of time properties, certiflcation of time properties in mobile code, granularity control in parallel/distributed computing, and resource-oriented specialization.

Más información

ID de Registro: 14317
Identificador DC: http://oa.upm.es/14317/
Identificador OAI: oai:oa.upm.es:14317
URL Oficial: http://dl.acm.org/citation.cfm?id=1389471
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 20 Ene 2013 10:15
Ultima Modificación: 21 Abr 2016 13:55
  • 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