Abstract | ||
---|---|---|
This paper describes the design of a garbage collection (GC) module, which introduces modern GC features to the domain of embedded implementations. It supports weak references and feeds reference queues. Its architecture allows multiple concurrent mutators operating on the shared managed memory. The garbage collection is exact and fully concurrent. It combines a distributed root marking with a centralized heap scan of the managed memory. It features a novel mark-and-copy GC strategy on a segmented memory, thereby overcoming the tremendous space overhead of two-space copying and the compaction race of mark-and-compact approaches. The proposed GC architecture has been practically implemented and proven using the embedded bytecode processor SHAP as a sample testbed. The synthesis results for settings up to three SHAP mutator cores are given and online functional measurements are presented. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-11950-7_4 | ARCS |
Keywords | Field | DocType |
modern gc,shap mutator core,novel mark-and-copy gc strategy,segmented memory,embedded bytecode processor shap,weak reference,embedded gc module,multiple mutators,managed memory,multiple concurrent mutators,proposed gc architecture,garbage collection,embedded implementation | Garbage,Computer science,Parallel computing,Testbed,Real-time computing,Heap (data structure),Memory management,Garbage collection,Memory segmentation,Memory management unit,Bytecode | Conference |
Volume | ISSN | ISBN |
5974 | 0302-9743 | 3-642-11949-2 |
Citations | PageRank | References |
2 | 0.37 | 14 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Thomas B. Preußer | 1 | 48 | 5.41 |
Peter Reichel | 2 | 27 | 1.41 |
Rainer G. Spallek | 3 | 137 | 25.30 |