Writing a Minimal Scheduler with eBPF, sched_ext, and C (clt25) episode artwork

EPISODE · Mar 23, 2025 · 54 MIN

Writing a Minimal Scheduler with eBPF, sched_ext, and C (clt25)

from Chaos Computer Club - archive feed (high quality) · host Johannes Bechberger

Today, eBPF is used for software-defined networking, observability, monitoring tools, and more. Previously, creating these was labor-intensive and had a high barrier to entry. With the new scheduler extensions, we can now add custom schedulers to this list. Sched_ext allows us to write schedulers with custom policies directly in eBPF. In this talk, we’ll develop a basic FIFO (First-In-First-Out) scheduler in C to show you how to get started with writing your own. If you’re interested in diving deeper into eBPF, join us for a quick hands-on intro to custom scheduling! Licensed to the public under http://creativecommons.org/licenses/by/4.0 about this event: https://chemnitzer.linux-tage.de/2025/de/programm/beitrag/221

Episode metadata supplied by the publisher feed · Published Mar 23, 2025

Embed this episode

NOW PLAYING

Writing a Minimal Scheduler with eBPF, sched_ext, and C (clt25)

0:00 54:53

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Chaos Computer Club - archive feed (high quality)?

This episode is 54 minutes long.

When was this Chaos Computer Club - archive feed (high quality) episode published?

This episode was published on March 23, 2025.

Can I download this Chaos Computer Club - archive feed (high quality) episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!