Live Heap Space Analysis for Languages with Garbage Collection

Albert Albiol, Elvira; Genaim, Samir y Gomez Zamalloa, Miguel (2009). Live Heap Space Analysis for Languages with Garbage Collection. En: "2009 International Symposium on Memory Management, ISMM '09", 19/06/2009 - 20/06/2009, Dublin, Irlanda. ISBN 978-1-60558-347-1.

Descripción

Título: Live Heap Space Analysis for Languages with Garbage Collection
Autor/es:
  • Albert Albiol, Elvira
  • Genaim, Samir
  • Gomez Zamalloa, Miguel
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 2009 International Symposium on Memory Management, ISMM '09
Fechas del Evento: 19/06/2009 - 20/06/2009
Lugar del Evento: Dublin, Irlanda
Título del Libro: Proceedings of the 2009 International Symposium on Memory Management, ISMM '09
Fecha: 2009
ISBN: 978-1-60558-347-1
Materias:
Palabras Clave Informales: Live Heap Space Analysis, Peak Memory Consumption, Low-level Languages, Java Bytecode.
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 (651kB) | Vista Previa

Resumen

The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run the program without exhausting the memory. It is well-known that garbage collection (GC) makes the problem of predicting the memory required to run a program difficult. This paper presents, the best of our knowledge, the first live heap space analysis for garbage-collected languages which infers accurate upper bounds on the peak heap usage of a program’s execution that are not restricted to any complexity class, i.e., we can infer exponential, logarithmic, polynomial, etc., bounds. Our analysis is developed for an (sequential) object-oriented bytecode language with a scoped-memory manager that reclaims unreachable memory when methods return. We also show how our analysis can accommodate other GC schemes which are closer to the ideal GC which collects objects as soon as they become unreachable. The practicality of our approach is experimentally evaluated on a prototype implementation.We demonstrate that it is fully automatic, reasonably accurate and efficient by inferring live heap space bounds for a standardized set of benchmarks, the JOlden suite.

Más información

ID de Registro: 5699
Identificador DC: http://oa.upm.es/5699/
Identificador OAI: oai:oa.upm.es:5699
URL Oficial: http://portal.acm.org/citation.cfm?id=1542450
Depositado por: Memoria Investigacion
Depositado el: 12 Ene 2011 12:03
Ultima Modificación: 20 Abr 2016 14:26
  • 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