Towards execution Time estimation in abstract machine-based (Logic) languages

Mera Menéndez, Edison Fernando and López García, Pedro and Carro Liñares, Manuel and Hermenegildo, Manuel V. (2017). Towards execution Time estimation in abstract machine-based (Logic) languages. Monografía (Technical Report). Facultad de Informática (UPM), Madrid, España.

Description

Title: Towards execution Time estimation in abstract machine-based (Logic) languages
Author/s:
  • Mera Menéndez, Edison Fernando
  • López García, Pedro
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Item Type: Monograph (Technical Report)
Date: 2017
Subjects:
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 (246kB) | Preview

Abstract

Abstract machines provide a certain separation between platform-dependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the specific 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, program-independent profiling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compiletime 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 allows taking into account lowlevel issues without having to tailor the analysis for each architecture and platform, and instead only having to redo the calibration step. Applications of such predicted execution times include debugging/verification of time properties, granularity control in parallel/distributed computing, and resource-oriented specialization.

More information

Item ID: 53073
DC Identifier: http://oa.upm.es/53073/
OAI Identifier: oai:oa.upm.es:53073
Official URL: http://cliplab.org/papers/mera07:towards_exec_time-tr.pdf
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 21 Nov 2018 14:37
Last Modified: 21 Nov 2018 14:37
  • 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