BPF LRU Per-CPU Hash Maps
Explains the structure, lookup and update behavior, eviction policy, concurrency model, and use cases of BPF LRU per-CPU hash maps.
// CATEGORY
Systems
Posts in this collection, ordered newest first.
APIs and ABIs
Distinguishes source-level APIs from binary-level ABIs, focusing on compatibility and function-call boundaries.
Process Control Blocks
Explains the fields in a process control block, process state transitions, and its role during context switches.
The TLB-Hit Model
Generalizes the TLB fast-path idea into a cache model for repeated policy decisions and analyzes its performance trade-offs.
eBPF for Windows
Explains the eBPF for Windows execution architecture, verifier, program and attach types, and networking and security use cases.
Mutual Exclusion
Explains how mutual exclusion prevents race conditions around shared resources and summarizes the requirements of correct synchronization.
Critical Sections
Explains how race conditions arise in critical sections and how locks, mutexes, semaphores, and spinlocks protect them.
Busy Waiting
Explains how busy waiting consumes CPU while waiting for a lock, along with its benefits, costs, and appropriate use cases.
Context Switching
Explains how processes and threads save and restore execution state during context switches and where the overhead comes from.
Spinlocks and Mutexes
Compares spinlocks and mutexes by waiting behavior, context-switch cost, and the conditions under which each is appropriate.
The eBPF VM
Explains the in-kernel eBPF execution model through its registers, bytecode, verifier, JIT compiler, helpers, and maps.