Sciweavers

386 search results - page 19 / 78
» Garbage collection for embedded systems
Sort
View
OOPSLA
1992
Springer
13 years 11 months ago
A Comparative Performance Evaluation of Write Barrier Implementations
Generational garbage collectors are able to achieve very small pause times by concentrating on the youngest (most recently allocated) objects when collecting, since objects have b...
Antony L. Hosking, J. Eliot B. Moss, Darko Stefano...
IWMM
2004
Springer
82views Hardware» more  IWMM 2004»
14 years 1 months ago
Write barrier elision for concurrent garbage collectors
Concurrent garbage collectors require write barriers to preserve consistency, but these barriers impose significant direct and indirect costs. While there has been a lot of work ...
Martin T. Vechev, David F. Bacon
ICFP
2012
ACM
11 years 10 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
IWMM
2000
Springer
82views Hardware» more  IWMM 2000»
13 years 11 months ago
The Case for Profile-Directed Selection of Garbage Collectors
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...
Robert P. Fitzgerald, David Tarditi
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
13 years 11 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira