Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models

Marron, Mark; Stefanovic, Darko; Kapur, Deepak y Hermenegildo, Manuel V. (2008). Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. En: "21th international workshop, Languages and compilers for parallel computing, LCPC 2008", 31/07/2008-02/08/2008, Edmonton, Alberta, Canadá. ISBN 978-3-540-89739-2.

Descripción

Título: Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models
Autor/es:
  • Marron, Mark
  • Stefanovic, Darko
  • Kapur, Deepak
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 21th international workshop, Languages and compilers for parallel computing, LCPC 2008
Fechas del Evento: 31/07/2008-02/08/2008
Lugar del Evento: Edmonton, Alberta, Canadá
Título del Libro: Proceedings of 21th international workshop, Languages and compilers for parallel computing, LCPC 2008
Fecha: 2008
ISBN: 978-3-540-89739-2
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 (504kB) | Vista Previa

Resumen

Dependence information between program values is extensively used in many program optimization techniques. The ability to identify statements, calls and loop iterations that do not depend on each other enables many transformations which increase the instruction and thread-level parallelism in a program. When program variables contain complex data structures including arrays, records, and recursive data structures, the ability to precisely model data dependence based on heap structure remains a challenging problem. This paper presents a technique for precisely tracking heap based data dependence in non-trivial Java programs via static analysis. Using an abstract interpretation framework, the approach extends a shape analysis technique based on an existing graph model of heaps, by integrating read/write history information and intelligent memorization. The method has been implemented and its effectiveness and utility are demonstrated by computing detailed dependence information for two benchmarks (Em3d and BH from the JOlden suite) and using this information to parallelize the benchmarks.

Más información

ID de Registro: 4374
Identificador DC: http://oa.upm.es/4374/
Identificador OAI: oai:oa.upm.es:4374
URL Oficial: http://www.cs.ualberta.ca/lcpc08/
Depositado por: Memoria Investigacion
Depositado el: 30 Sep 2010 07:53
Ultima Modificación: 20 Abr 2016 13:37
  • 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