Guillaume Chatelet

Guillaume Chatelet

Auto-generated profile, based on publicly available information

Guillaume Chatelet

Google Research, France

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2021
Verified
Conference Paper
Open access
GCGuillaume Chatelet
Guillaume Chatelet
CKChris Kennelly
Chris Kennelly
SXSam (Likun) Xi
Sam (Likun) Xi
OSOndrej Sykora
Ondrej Sykora
CCClément Courbet
Clément Courbet
BBBruno De Backer
Bruno De Backer
Memory manipulation primitives (memcpy, memset, memcmp) are used by virtually every application, from high performance computing to user interfaces. They often consume a significant portion of CPU cycles. Because they are so ubiquitous and critical, they are provided by language runtimes and in particular by libc, the C standard library. These implementations are heavily optimized, typically written in hand-tuned assembly for each target architecture. In this article, we propose a principled alternative to hand-tuning these functions: (1) we profile the calls to these functions in their production environment and use this data to drive the important high-level algorithmic decisions, (2) we use a high-level language for the implementation, delegate the job of tuning the generated code to the compiler, and (3) we use constraint programming and automatic benchmarks to select the optimal high-level structure of the functions. We compile our memfunctions implementations using the same compiler toolchain that we use for application code, which allows leveraging the compiler further by allowing whole-program optimization. We have evaluated our approach by applying it to the fleet of one of the largest computing enterprises in the world. This work increased the performance of the fleet by 1%.