Live Heap Space Analysis for Languages with Garbage Collection

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

Description

Title: Live Heap Space Analysis for Languages with Garbage Collection
Author/s:
  • Albert Albiol, Elvira
  • Genaim, Samir
  • Gomez Zamalloa, Miguel
Item Type: Presentation at Congress or Conference (Article)
Event Title: 2009 International Symposium on Memory Management, ISMM '09
Event Dates: 19/06/2009 - 20/06/2009
Event Location: Dublin, Irlanda
Title of Book: Proceedings of the 2009 International Symposium on Memory Management, ISMM '09
Date: 2009
ISBN: 978-1-60558-347-1
Subjects:
Freetext Keywords: Live Heap Space Analysis, Peak Memory Consumption, Low-level Languages, Java Bytecode.
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 (651kB) | Preview

Abstract

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.

More information

Item ID: 5699
DC Identifier: http://oa.upm.es/5699/
OAI Identifier: oai:oa.upm.es:5699
Official URL: http://portal.acm.org/citation.cfm?id=1542450
Deposited by: Memoria Investigacion
Deposited on: 12 Jan 2011 12:03
Last Modified: 20 Apr 2016 14:26
  • 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