Scalable concurrent and parallel mark
Balaji Iyengar, Edward F. Gehringer, Michael E. Wolf et al. · International Symposium on Memory Management · 2012
Parallel marking algorithms use multiple threads to walk through the object heap graph and mark each reachable object as live. Parallel marker threads mark an object "live" by atomically setting a bit in a mark-bitmap or a bit in the object header. Most of these parallel algorithms strive to improve the marking throughput by using work-stealing algorithms for load-balancing and to ensure that all participating threads are kept busy. A purely "processor-centric" load-balancing approach in conjunction with a need to atomically set the mark bit, results in significant contention during parallel marking. This limits the scalability and throughput of parallel marking algorithms.
Cited by 8 works. doi:10.1145/2258996.2259006
Authors
References
- MULTILISP: a language for concurrent symbolic computation
- The DaCapo benchmarks
- What Every Programmer Should Know About Memory
- Thread scheduling for multiprogrammed multiprocessors
- On-the-Fly Garbage Collection: An Exercise in Cooperation
- Garbage-first garbage collection
- Parallel Garbage Collection for Shared Memory Multiprocessors
- On-the-fly darbage collection: an exercise in cooeration
- The pauseless GC algorithm
- The Garbage Collection Handbook: The Art of Automatic Memory Management