
How Linux SLUB Allocator Reduces Memory Fragmentation
In this episode, Lucas and Luna dive into the SLUB allocator, the default memory allocator in the Linux kernel since 2.6.23. They explain how SLUB reduces fragmentation compared to its predecessor SLAB, using the concept of per-CPU partial lists and object caching. With a concrete example of a web server handling many small requests, they show how SLUB's design keeps memory allocation fast and efficient, reducing overhead and improving system stability. They also discuss real-world tuning parameters like slub_min_objects and slub_cpu_partial, and how SLUB affects performance in containerized environments. Perfect for Linux enthusiasts and sysadmins looking to understand the internals of memory management.
#Linux #SLUBAllocator #MemoryManagement #Kernel #OpenSource #Technology #SystemsProgramming #Performance #Fragmentation #Sysadmin #Containers #ServerStack #OperatingSystems #FexingoBusiness #BusinessPodcast #TechPodcast #LinuxKernel #MemoryAllocator
Keep every episode free: buymeacoffee.com/fexingo
Information
- Show
- FrequencyUpdated Daily
- PublishedAugust 29, 2026 at 11:01 PM UTC
- Length12 min
- Season4
- Episode169
- RatingClean