Direction de recherche : Marc SHAPIRO
Co-encadrement : THOMAS Gaël, MULLER Gilles
Ramasse-miettes pour les machines virtuelles sur les processeurs multicoeurs
Large-scale multicore architectures create new challenges for garbage collectors (GCs). On contemporary cache-coherent Non-Uniform Memory Access (ccNUMA) architectures, applications with a large memory footprint suffer from the cost of the garbage collector (GC), because, as the GC scans the reference graph, it makes many remote memory accesses, saturating the interconnect between memory nodes. In this thesis, we address this problem with NumaGiC, a GC with a mostly-distributed design.
In order to maximise memory access locality during collection, a GC thread avoids accessing a different memory node, instead notifying a remote GC thread with a message; nonetheless, NumaGiC avoids the drawbacks of a pure distributed design, which tends to decrease parallelism and increase memory access imbalance, by allowing threads to steal from other nodes when they are idle. NumaGiC strives to find a perfect balance between local access, memory access balance, and parallelism.
In this work, we compare NumaGiC with Parallel Scavenge and some of its incrementally improved variants on two different ccNUMA architectures running on the Hotspot Java Virtual Machine of OpenJDK 7. On Spark and Neo4j, two industry-strength analytics applications, with heap sizes ranging from 160 GB to 350 GB, and on SPECjbb2013 and SPECjbb2005, NumaGiC improves overall performance by up to 94% over Parallel Scavenge, and increases the performance of the collector itself by up to 5.4× over Parallel Scavenge. In terms of scalability of GC throughput with increasing number of NUMA nodes, NumaGiC scales substantially better than Parallel Scavenge for all the applications. In fact in case of SPECjbb2005, where inter-node object references are the least among all, NumaGiC scales almost linearly.
Soutenance : 28/09/2015 - 13h30 - Site Jussieu 25-26/105
Membres du jury :
M. Vivien Quema, Grenoble INP/ENSIMAG [Rapporteur]
M. Luis Veiga, Instituto Superior Técnico - ULisboa | INESC-ID Lisboa [Rapporteur]
M. Albert Cohen, Département d'Informatique - ENS/INRIA
M. Tim Harris, Oracle Labs, Cambridge
M. Marc Shapiro, Université Pierre et Marie Curie (LIP6/INRIA)
M. Gaël Thomas, Telecom SudParis (HPS)
- L. Gidra : “GARBAGE collection for managed runtime on multicore processors”, thèse, soutenance 28/09/2015, direction de recherche Shapiro, Marc, co-encadrement : Thomas, Gaël, Muller, Gilles (2015)
- L. Gidra, G. Thomas, J. Sopena, M. Shapiro, Nh. Nguyen : “NumaGiC: a Garbage Collector for Big Data on Big NUMA Machines”, Architectural Support for Programming Languages and Operating Systems (ASPLOS), Istanbul, Turkey, pp. 661-673, (ACM) (2015)
- L. Gidra, G. Thomas, J. Sopena, M. Shapiro : “A study of the scalability of stop-the-world garbage collectors on multicores”, ASPLOS 13 - Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems, Houston, United States, pp. 229-240, (ACM) (2013)
- L. Gidra, G. Thomas, J. Sopena, M. Shapiro : “Assessing the Scalability of Garbage Collectors on Many Cores”, Operating Systems Review, vol. 45 (3), Best papers from PLOS'11, pp. 15-19, (Association for Computing Machinery) (2011)
- L. Gidra, G. Thomas, J. Sopena, M. Shapiro : “Assessing the Scalability of Garbage Collectors on Many Cores”, PLOS '11 - 6th Workshop on Programming Languages and Operating Systems, Cascais, Portugal, pp. 7:1-7:5, (ACM) (2011)