Combining static analysis and profiling for estimating execution times in logic programs

Mera, E.; López García, Pedro; Puebla Sánchez, Alvaro Germán; Carro Liñares, Manuel y Hermenegildo, Manuel V. (2006). Combining static analysis and profiling for estimating execution times in logic programs. Monografía (Informe Técnico). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: Combining static analysis and profiling for estimating execution times in logic programs
Autor/es:
  • Mera, E.
  • López García, Pedro
  • Puebla Sánchez, Alvaro Germán
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Informe Técnico)
Fecha: Abril 2006
Materias:
Palabras Clave Informales: Execution time estimation, Cost analysis, Profiling, Resource awareness, Cost models, Mobile computing, Tiempo estimado de ejecución, Análisis de coste, Perfilamiento, Concienciación de los recursos, Modelos de gastos, Computación móvil.
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 (862kB) | Vista Previa

Resumen

Effective static analyses have been proposed which allow inferring functions which bound the number of resolutions or reductions. These have the advantage of being independent from the platform on which the programs are executed and such bounds have been shown useful in a number of applications, such as granularity control in parallel execution. On the other hand, in certain distributed computation scenarios where different platforms come into play, with each platform having different capabilities, it is more interesting to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution time. With this objective in mind, we propose a method which allows inferring upper and lower bounds on the execution times of procedures of a program in a given execution platform. The approach combines compile-time cost bounds analysis with a one-time profiling of the platform in order to determine the values of certain constants for that platform. These constants calibrate a cost model which from then on is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in the given platform. The approach has been implemented and integrated in the CiaoPP system.

Más información

ID de Registro: 14738
Identificador DC: http://oa.upm.es/14738/
Identificador OAI: oai:oa.upm.es:14738
URL Oficial: http://clip.dia.fi.upm.es/papers/estim-exec-time-tr.pdf
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 04 Abr 2013 07:36
Ultima Modificación: 21 Abr 2016 14:32
  • 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