Sciweavers

47 search results - page 7 / 10
» Parametric inference of memory requirements for garbage coll...
Sort
View
VEE
2005
ACM
218views Virtualization» more  VEE 2005»
14 years 1 months ago
The pauseless GC algorithm
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
Cliff Click, Gil Tene, Michael Wolf
ACMMSP
2005
ACM
129views Hardware» more  ACMMSP 2005»
14 years 1 months ago
A locality-improving dynamic memory allocator
In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locali...
Yi Feng, Emery D. Berger
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
12 years 10 months ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
OOPSLA
2004
Springer
14 years 24 days ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
ASPLOS
2011
ACM
12 years 11 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...