Sciweavers

12 search results - page 2 / 3
» iwmm 2007
Sort
View
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
13 years 11 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
13 years 11 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina
IWMM
2007
Springer
130views Hardware» more  IWMM 2007»
13 years 11 months ago
Accordion arrays
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
Craig B. Zilles
IWMM
2007
Springer
118views Hardware» more  IWMM 2007»
13 years 11 months ago
Detecting and eliminating memory leaks using cyclic memory allocation
We present and evaluate a new technique for detecting and eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program...
Huu Hai Nguyen, Martin C. Rinard
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
13 years 11 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...