Sciweavers

17 search results - page 1 / 4
» Multicore garbage collection with local heaps
Sort
View
IWMM
2011
Springer
204views Hardware» more  IWMM 2011»
13 years 1 months ago
Multicore garbage collection with local heaps
In a parallel, shared-memory, language with a garbage collected heap, it is desirable for each processor to perform minor garbage collections independently. Although obvious, it i...
Simon Marlow, Simon L. Peyton Jones
IWMM
2010
Springer
157views Hardware» more  IWMM 2010»
14 years 3 months ago
Tracing garbage collection on highly parallel platforms
The pervasiveness of multiprocessor and multicore hardware and the rising level of available parallelism are radically changing the computing landscape. Can software deal with tom...
Katherine Barabash, Erez Petrank
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
13 years 1 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...
SCAM
2005
IEEE
14 years 4 months ago
A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading
Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garb...
Richard E. Jones, Andy C. King
CC
2001
Springer
121views System Software» more  CC 2001»
14 years 3 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert