University of Borås

Borås Academic Digital Archive (BADA) >
Forskningspublikationer / Research Publications >
Institutionen Handels- och IT-högskolan / School of Business and IT (HIT) >
Informatik / Informatics >
Konferensbidrag / Conference papers (Informatics) >

Please use this identifier to cite or link to this item:

Files in This Item:

There are no files associated with this item.

Title: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
Authors: Nguyen, Nhan
Tsigas, Philippas
Sundell, Håkan
Editors: Aguilera, Marcos K.
Shapiro, Marc
Department: University of Borås. School of Business and IT
Issue Date: 2014
Citation: OPODIS 2014. The 18th International Conference on Principles of Distributed Systems, Cortina d'Ampezzo, Italy, 16-19 December, 2014
Pages: 372-387
Series/Report no.: Lecture Notes in Computer Science
Publisher: Springer
Media type: text
Publication type: conference paper, peer reviewed
Keywords: garbage collector
concurrent programming
parallel garbage collection
lock-free data structures
Subject Category: Subject categories::Engineering and Technology::Computer and Information Science::Computer Science
Research Group: CSL@BS
Area of Research: Parallel Computing
Strategic Research Area: Business and IT
Abstract: Mark-split is a garbage collection algorithm that combines advantages of both the mark-sweep and the copying collection algorithms. In this paper, we present a parallel mark-split garbage collector (GC). Our parallel design introduces and makes use of an efficient concurrency control mechanism for handling the list of free memory intervals. This mechanism is based on a lock-free skip-list design which supports an extended set of operations. Beside basic operations, it can perform a composite one that can search and remove and also insert two elements atomically. We have implemented the parallel mark-split GC in OpenJDK’s HotSpot virtual machine. We experimentally evaluate our collector and compare it with the default concurrent mark-sweep GC in HotSpot, using the DaCapo benchmarks, on two contemporary multiprocessor systems; one has 12 Intel Nehalem cores with HyperThreading and the other has 48 AMD Bulldozer cores. The evaluation shows that our parallel mark-split keeps the characteristics of the sequential mark-split, that it performs better than the concurrent mark-sweep in applications that have low live/garbage ratio, and have live objects locating contiguously, therefore being marked consecutively. Our parallel mark-split performs significantly better than a trivial parallelization based on locks in terms of both collection time and scalability.
Sustainable development: -
Appears in Collections:Konferensbidrag / Conference papers (Informatics)

SFX Query

All items in Borås Academic Digital Archive are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2010  The DSpace Foundation