Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
Paper i proceeding, 2013

This brief announcement provides a high level overview of a parallel mark-split garbage collector. Our parallel design introduces and makes use of an efficient concurrency control mechanism based on a lock-free skip-list design for handling the list of free memory intervals. We have implemented the parallel mark-split garbage collector in OpenJDK HotSpot as a parallel and concurrent garbage collector for the old generation. We experimentally evaluate the collector and compare it with the default concurrent mark-sweep garbage collector in OpenJDK HotSpot, using the DaCapo benchmarks.

garbage collection

HotSpot

parallel garbage collection

lock-free

skip-list

mark-split

Författare

Dang Nhan Nguyen

Chalmers, Data- och informationsteknik, Nätverk och system

Philippas Tsigas

Chalmers, Data- och informationsteknik, Nätverk och system

Distributed Computing. The 27th International Symposium on Distributed Computing (DISC 2013) (Lecture Notes in Computer Science series)

Vol. 8205 557-558

Ämneskategorier

Datorteknik

Data- och informationsvetenskap

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

ISBN

978-3-642-41526-5

Mer information

Skapat

2017-10-07