Towards execution time estimation in abstract machine-based languages

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

Description

Title: Towards execution time estimation in abstract machine-based languages
Author/s:
  • Mera, E.
  • López García, Pedro
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Event Dates: 15-17 July, 2008
Event Location: Valencia, Spain
Title of Book: PPDP '08 Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Date: 2008
ISBN: 978-1-60558-117-0
Subjects:
Freetext Keywords: 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.
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

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.

More information

Item ID: 14317
DC Identifier: http://oa.upm.es/14317/
OAI Identifier: oai:oa.upm.es:14317
Official URL: http://dl.acm.org/citation.cfm?id=1389471
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 20 Jan 2013 10:15
Last Modified: 21 Apr 2016 13:55
  • 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