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.
// TAG
Posts in this collection, ordered newest first.
Explains the structure, lookup and update behavior, eviction policy, concurrency model, and use cases of BPF LRU per-CPU hash maps.
Explains the fields in a process control block, process state transitions, and its role during context switches.
Compares spinlocks and mutexes by waiting behavior, context-switch cost, and the conditions under which each is appropriate.
Explains the in-kernel eBPF execution model through its registers, bytecode, verifier, JIT compiler, helpers, and maps.