Topology-aware parallelism for NUMA copying collectors

Alnowaiser, K. and Singer, J. (2016) Topology-aware parallelism for NUMA copying collectors. Lecture Notes in Computer Science, 9519, pp. 191-205. (doi:10.1007/978-3-319-29778-1_12)

[img]
Preview
Text
115001.pdf - Accepted Version

891kB

Abstract

NUMA-aware parallel algorithms in runtime systems attempt to improve locality by allocating memory from local NUMA nodes. Researchers have suggested that the garbage collector should profile memory access patterns or use object locality heuristics to determine the target NUMA node before moving an object. However, these solutions are costly when applied to every live object in the reference graph. Our earlier research suggests that connected objects represented by the rooted sub-graphs provide abundant locality and they are appropriate for NUMA architecture. In this paper, we utilize the intrinsic locality of rooted sub-graphs to improve parallel copying collector performance. Our new topology-aware parallel copying collector preserves rooted sub-graph integrity by moving the connected objects as a unit to the target NUMA node. In addition, it distributes and assigns the copying tasks to appropriate (i.e. NUMA node local) GC threads. For load balancing, our solution enforces locality on the work-stealing mechanism by stealing from local NUMA nodes only. We evaluated our approach on SPECjbb2013, DaCapo 9.12 and Neo4j. Results show an improvement in GC performance by up to 2.5x speedup and 37 % better application performance.

Item Type:Articles
Additional Information:LCPC 2015: The 28th International Workshop on Languages and Compilers for Parallel Computing, Raleigh, NC, USA, 9-11 Sept 2015.
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Singer, Dr Jeremy
Authors: Alnowaiser, K., and Singer, J.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:0302-9743
ISSN (Online):0302-9743
Published Online:20 February 2016
Copyright Holders:Copyright © 2016 Springer International Publishing Switzerland
First Published:First published in Lecture Notes in Computer Science 9519:191-205
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
614231AnyScale ApplicationsJeremy SingerEngineering & Physical Sciences Research Council (EPSRC)EP/L000725/1COM - COMPUTING SCIENCE