Pith. sign in

REVIEW 4 cited by

The eBPF Runtime in the Linux Kernel

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.00026 v2 pith:D6MZ5YS7 submitted 2024-09-16 cs.OS cs.CE

classification cs.OScs.CE
keywords kernelebpfruntimelinuxprogramsafeuserswhile
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Extended Berkeley Packet Filter (eBPF) is a runtime that enables users to load programs into the operating system (OS) kernel, like Linux or Windows, and execute them safely and efficiently at designated kernel hooks. Each program passes through a verifier that reasons about the safety guarantees for execution. Hosting a safe virtual machine runtime within the kernel makes it dynamically programmable. Unlike the popular approach of bypassing or completely replacing the kernel, eBPF gives users the flexibility to modify the kernel on the fly, rapidly experiment and iterate, and deploy solutions to achieve their workload-specific needs, while working in concert with the kernel. In this paper, we present the first comprehensive description of the design and implementation of the eBPF runtime in the Linux kernel. We argue that eBPF today provides a mature and safe programming environment for the kernel. It has seen wide adoption since its inception and is increasingly being used not just to extend, but program entire components of the kernel, while preserving its runtime integrity. We outline the compelling advantages it offers for real-world production usage, and illustrate current use cases. Finally, we identify its key challenges, and discuss possible future directions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LearnedCache: eBPF-Integrated Perceptron-Based Eviction Policies for the Linux Page Cache

    cs.OS 2026-05 unverdicted novelty 7.0 of 10

    LearnedCache shows a quantized one-layer perceptron, trained on eBPF kernel traces and deployed through cache_ext, can beat FIFO page-cache eviction on some Filebench workloads.

  2. Characterizing and Bridging the Diagnostic Gap in eBPF Verifier Rejections

    cs.OS 2026-07 conditional novelty 6.5 of 10

    bpfix localizes where eBPF programs lose verifier-required proofs from the log alone, and that localization raises LLM repair success by 11–21pp on 75 tasks.

  3. Arcturus: A Cloud Overlay Network for Global Accelerator with Enhanced Performance and Stability

    cs.NI 2025-07 conditional novelty 6.0 of 10

    A multi-cloud overlay network using cheap tier-2/3 VMs can serve as a global accelerator with latency better than or comparable to AWS and GCP at 71% lower cost, if the paper's extrapolated scale estimate holds.

  4. Swift: Rethinking RDMA Control Plane for Elastic Computing

    cs.NI 2025-01 conditional novelty 6.0 of 10

    A user-space RDMA control plane, using cached libibverbs calls and fork-shared queue pairs, matches a kernel-based design in setup time while improving data plane throughput by 30-46%.

Pith tools