Compile-Time Analysis of Compiler Frameworks for Query Compilation
Low compilation times are highly important in contexts of Just-in-time compilation. This not only applies to language runtimes for Java, WebAssembly, or JavaScript, but is also crucial for database systems that employ query compilation as the primary measure for achieving high throughput in combination with low query execution time.
We present a performance comparison and detailed analysis of the compile times of the JIT compilation back-ends provided by GCC, LLVM, Cranelift, and a single-pass compiler in the context of database queries. Our results show that LLVM achieves the highest execution performance, but can compile substantially faster when tuning for low compilation time. Cranelift achieves a similar run-time performance to unoptimized LLVM, but compiles just 20–35% faster and is outperformed by the single-pass compiler, which compiles code 16x faster than Cranelift at similar execution performance.
Tue 5 MarDisplayed time zone: London change
11:30 - 12:50 | |||
11:30 20mTalk | Compile-Time Analysis of Compiler Frameworks for Query Compilation Main Conference Pre-print | ||
11:50 20mTalk | DrPy: Pinpointing Inefficient Memory Usage in Multi-Layer Python Applications Main Conference Jinku Cui North Carolina State University, Qidong Zhao North Carolina State University, Yueming Hao North Carolina State University, Xu Liu North Carolina State University | ||
12:10 20mTalk | SCHEMATIC: Compile-Time Checkpoint Placement and Memory Allocation for Intermittent Systems Main Conference Hugo Reymond Université de Rennes - Inria - CNRS - IRISA, Jean-Luc Béchennec Nantes Université - École Centrale Nantes - CNRS - LS2N - UMR 6004, Mikaël Briday Nantes Université - École Centrale Nantes - CNRS - LS2N - UMR 6004, Sébastien Faucou Nantes Université - École Centrale Nantes - CNRS - LS2N - UMR 6004, Isabelle Puaut Université de Rennes - Inria - CNRS - IRISA, Erven Rohou Université de Rennes - Inria - CNRS - IRISA Pre-print Media Attached | ||
12:30 20mTalk | Latent Idiom Recognition for a Minimalist Functional Array Language using Equality Saturation Main Conference Pre-print |