Memorias de investigación
Ponencias en congresos:
Identification of Heap¿Carried Data Dependence Via Explicit Store Heap Models
Año:2008
Áreas de investigación
  • Lenguaje de programación
Datos
Descripción
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 memoization. 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.
Internacional
Si
Nombre congreso
Languages and Compilers for Parallel Computing 21th International Workshop, LCPC 2008
Tipo de participación
960
Lugar del congreso
Revisores
Si
ISBN o ISSN
978-3-540-89739-2
DOI
Fecha inicio congreso
31/07/2008
Fecha fin congreso
02/08/2008
Desde la página
94
Hasta la página
108
Título de las actas
Identification of Heap¿Carried Data Dependence Via Explicit Store Heap Models
Esta actividad pertenece a memorias de investigación
Participantes
  • Participante: Darko Stefanovic University of New Mexico
  • Participante: Deepak Kapur University of New Mexico
  • Autor: Manuel de Hermenegildo Salinas UPM
  • Participante: Mark Marron University of New Mexico
Grupos de investigación, Departamentos, Centros e Institutos de I+D+i relacionados
  • Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
  • Departamento: Inteligencia Artificial