14 search results - page 2 / 3 » Write barrier elision for concurrent garbage collectors |
IWMM
2000
Springer
13 years 11 months ago
2000
Springer
Many garbage-collected systems use a single garbage collection algorithm across all applications. It has long been known that this can produce poor performance on applications for...
OOPSLA
1999
Springer
13 years 12 months ago
1999
Springer
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which ...
IWMM
2004
Springer
14 years 1 months ago
2004
Springer
We document the design and implementation of a “production” incremental garbage collector for GHC 6.2. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s ...
SIGPLAN
2002
13 years 7 months ago
2002
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
OOPSLA
2001
Springer
14 years 3 days ago
2001
Springer
Reference counting is not naturally suitable for running on multiprocessors. The update of pointers and reference counts requires atomic and synchronized operations. We present a ...