Skip to content

From Custom-Fit to Portable: Bridging the Gap Between Synthesized and Engineered GPU Query Execution

Jul 2026 · arXiv.org · Vol abs/2607.07632 · 1 citation · 47 references
Computer Science

TL;DR

This work revisits the synthesize-versus-engineer debate for GPU analytics by answering three questions: how good is synthesized GPU code?

Abstract

GPUs are increasingly used for analytical query processing, but developing GPU-based database engines that achieve the peak performance of the underlying hardware requires substantial research and engineering effort. A recent line of work argues that query processing should be synthesized, not engineered. In this scenario, instead of tuning a general-purpose engine to fit a workload, a large language model (LLM) generates code specialized to one query, one dataset, and one machine, thereby achieving an order-of-magnitude improvement in performance. This thesis, however, has so far been tested only on CPUs. In this work, we revisit the synthesize-versus-engineer debate for GPU analytics by answering three questions: (i) how good is synthesized GPU code?, (ii) why is it faster than engineered engines?, and (iii) how much of its advantage can be transferred back into a single, performance-portable engine? To answer the first question, we present SHADB, an LLM-based synthesis framework that generates optimized CUDA or HIP kernels using an automated, profile-guided optimization loop. Using SHADB, we show that the synthesized code approaches the memory-bandwidth ceiling and outperforms a state-of-the-art JIT-compiled GPU database engine (HeavyDB) by 7.4$\times$ on SSB SF100. To answer the second question, we decompose this performance gap and systematically classify optimizations as generalizable or workload-specific. Finally, to answer the third question, we integrate these generalizable optimizations into SYCLDB, a performance-portable engine written entirely in the open SYCL programming model. Using optimized SYCLDB, we show that it is possible to substantially bridge the gap to synthesized code (within 1.27$\times$ total execution time) while retaining workload-level generality and hardware-level performance portability.

View source

Similar papers

Lessons Learned Building Cross-Architecture Analytical Engines

This thesis explores hardware-software co-design for data-intensive applications, targeting the unification of programming models using open standards and exploring experimental techniques for automated query synthesis, and presents X-BQSR, a holistic redesign of genomic base quality score recalibration pipelines.

I. D. Kabadzhov · 0 citations

Automated Operator Fusion for GPU-Accelerated SQL: Generation and Evolutionary Refinement

This work targets the middle ground between per-operator hand-written kernels and bespoke implementations synthesized for an entire workload or execution engine, and finds that strong code models can often generate buildable and equivalent fused Triton kernels, and that these kernels can improve end-to-end runtime when...

CoreyLammie, Yotam Perlitz, Andrea Giovannini et al. · 0 citations
Preprint Sep 2026

Python in the front, party in the Backline: compiling quantum workloads across CPUs, GPUs, and FPGAs

This work introduces Backline, a heterogeneous compilation and runtime framework built within PennyLane and Catalyst that allows researchers to write workloads in high-level languages that map to low-latency execution across diverse distributed target platforms, and demonstrates the compilation and execution of several...

Joseph K. L. Lee, M. Malekmohammadi, Hong-Sheng Zheng et al. · 0 citations
#machine learning Preprint Aug 2026

DataKernelBench: Can LLMs Optimize Database Queries on GPUs?

DataKernelBench is introduced, which translates SQL into validated PyTorch TorchPlan programs and evaluates LLMs that optimize either the core tensor-bounded snippet or the full query in CUDA or Triton through execution-guided repair and finds that higher-performing implementations commonly use kernel fusion and execut...

Gokul Karthik Kumar, Yotam Perlitz, Corey Lammie et al. · 1 citation

Maintainable, Low-Latency and High-Quality Query Compilation with MLIR and TPDE

A low-latency MLIR compilation backend based on TPDE that by-passes the LLVM lowering and compilation pipeline is introduced and techniques that reduce MLIR’s intrinsic overhead are proposed.

Jonas Ladner, Lukas Döllerer, Alexis Engelke et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.