A static heap analysis for shape and connectivity: Unified memory analysis: The base framework

Marron, Mark; Kapur, Deepak; Stefanovic, Darko y Hermenegildo, Manuel V. (2007). A static heap analysis for shape and connectivity: Unified memory analysis: The base framework. En: "19th International Workshop, LCPC 2006", November 2-4, 2006, New Orleans, LA, USA. ISBN 978-3-540-72520-6.

Descripción

Título: A static heap analysis for shape and connectivity: Unified memory analysis: The base framework
Autor/es:
  • Marron, Mark
  • Kapur, Deepak
  • Stefanovic, Darko
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 19th International Workshop, LCPC 2006
Fechas del Evento: November 2-4, 2006
Lugar del Evento: New Orleans, LA, USA
Título del Libro: Languages and compilers for parallel computing
Fecha: 2007
ISBN: 978-3-540-72520-6
Volumen: 4382
Materias:
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

Modeling the evolution of the state of program memory during program execution is critical to many parallehzation techniques. Current memory analysis techniques either provide very accurate information but run prohibitively slowly or produce very conservative results. An approach based on abstract interpretation is presented for analyzing programs at compile time, which can accurately determine many important program properties such as aliasing, logical data structures and shape. These properties are known to be critical for transforming a single threaded program into a versión that can be run on múltiple execution units in parallel. The analysis is shown to be of polynomial complexity in the size of the memory heap. Experimental results for benchmarks in the Jolden suite are given. These results show that in practice the analysis method is efflcient and is capable of accurately determining shape information in programs that créate and manipúlate complex data structures.

Más información

ID de Registro: 14341
Identificador DC: http://oa.upm.es/14341/
Identificador OAI: oai:oa.upm.es:14341
URL Oficial: http://link.springer.com/chapter/10.1007%2F978-3-540-72521-3_25?LI=true
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 23 Ene 2013 07:40
Ultima Modificación: 21 Abr 2016 13:58
  • 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