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

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

Description

Title: A static heap analysis for shape and connectivity: Unified memory analysis: The base framework
Author/s:
  • Marron, Mark
  • Kapur, Deepak
  • Stefanovic, Darko
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 19th International Workshop, LCPC 2006
Event Dates: November 2-4, 2006
Event Location: New Orleans, LA, USA
Title of Book: Languages and compilers for parallel computing
Date: 2007
ISBN: 978-3-540-72520-6
Volume: 4382
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 (1MB) | Preview

Abstract

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.

More information

Item ID: 14341
DC Identifier: http://oa.upm.es/14341/
OAI Identifier: oai:oa.upm.es:14341
Official URL: http://link.springer.com/chapter/10.1007%2F978-3-540-72521-3_25?LI=true
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 23 Jan 2013 07:40
Last Modified: 21 Apr 2016 13:58
  • 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