Sciweavers

245 search results - page 2 / 49
» Garbage collection without paging
Sort
View
WOSP
2010
ACM
14 years 7 days ago
A page fault equation for dynamic heap sizing
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
Y. C. Tay, X. R. Zong
ASPLOS
2009
ACM
14 years 6 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz
CGO
2007
IEEE
13 years 11 months ago
Isla Vista Heap Sizing: Using Feedback to Avoid Paging
Managed runtime environments (MREs) employ garbage collection (GC) for automatic memory management. However, GC induces pressure on the virtual memory (VM) manager, since it may t...
Chris Grzegorczyk, Sunil Soman, Chandra Krintz, Ri...
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
12 years 8 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...
ICDCS
2005
IEEE
13 years 11 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...